Structural properties and edge choosability of planar graphs without 4-cycles

DOI10.1016/j.disc.2007.09.048zbMath1194.05043OpenAlexW2080070078MaRDI QIDQ998462

Wenjie He, Yongqiang Zhao, Guo-ping Zheng, Yu-fa Shen

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.09.048

zbMATH Keywords

cyclesplanar graphsstructural propertiesedge choosability

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable ⋮ List-edge-coloring of planar graphs without 6-cycles with three chords ⋮ List edge coloring of planar graphs without 6-cycles with two chords ⋮ A note on edge-choosability of planar graphs without intersecting 4-cycles ⋮ Edge-choosability of planar graphs without non-induced 5-cycles ⋮ List edge coloring of planar graphs without non-induced 6-cycles

Cites Work

• Edge choosability of planar graphs without short cycles
• Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs
• List edge chromatic number of graphs with large girth
• Edge-choosability in line-perfect multigraphs
• Edge-choosability of multicircuits
• List edge and list total colourings of multigraphs
• Choosability and edge choosability of planar graphs without five cycles
• List edge-colorings of series-parallel graphs
• Edge choosability of planar graphs without small cycles
• The list chromatic index of a bipartite multigraph
• Structural Properties and Edge Choosability of Planar Graphs without 6-Cycles
• Some upper bounds on the total and list chromatic numbers of multigraphs
• New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
• Graphs of degree 4 are 5-edge-choosable
• 25 pretty graph colouring problems

This page was built for publication: Structural properties and edge choosability of planar graphs without 4-cycles