Structural Properties and Edge Choosability of Planar Graphs without 6-Cycles
Weifan Wang, Ko‐Wei Lih · Combinatorics Probability Computing · 2001
Let G be a planar graph without 6-cycles. We investigate structural properties of G and show that G is edge-(Δ(G) + 1)-choosable when its maximum degree Δ(G) is not 5. We also study the 3-degeneracy property of G.