Planar graphs without chordal 6-cycles are 4-choosable

DOI10.1016/j.dam.2018.03.014zbMath1387.05056OpenAlexW2794811533MaRDI QIDQ1752596

Danjun Huang, Dai-Qiang Hu, Wei Fan Wang, Jian Liang Wu

Publication date: 24 May 2018

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

Full work available at URL: https://doi.org/10.1016/j.dam.2018.03.014

zbMATH Keywords

cycleplanar graphchordlist coloring

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Acyclic choosability of graphs with bounded degree ⋮ Acyclic coloring of graphs with maximum degree 7 ⋮ 不含带弦6-圈和项链图的平面图是DP-4-可染的 ⋮ List coloring and diagonal coloring for plane graphs of diameter two

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• List colourings of planar graphs
• Planar graphs without cycles of specific lengths
• Colorings and orientations of graphs
• The 4-choosability of plane graphs without 4-cycles
• Every planar graph is 5-choosable
• Choosability and edge choosability of planar graphs without five cycles
• On structure of some plane graphs with application to choosability
• A not 3-choosable planar graph without 3-cycles
• Vertex arboricity of planar graphs without chordal 6-cycles
• Planar Graphs without 7-Cycles Are 4-Choosable
• Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles

This page was built for publication: Planar graphs without chordal 6-cycles are 4-choosable