Planar graphs without intersecting 5-cycles are 4-choosable

DOI10.1016/j.disc.2017.03.012zbMath1362.05036OpenAlexW2606668412MaRDI QIDQ2397522

Dai-Qiang Hu, Jian Liang Wu

Publication date: 22 May 2017

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

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

zbMATH Keywords

cycleplanar graphlist coloringchoosable graphs

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 (8)

Planar graphs without intersecting 5-cycles are signed-4-choosable ⋮ A sufficient condition for planar graphs to be DP-4-colorable ⋮ DP-4-coloring of planar graphs with some restrictions on cycles ⋮ List coloring and diagonal coloring for plane graphs of diameter two ⋮ DP-4-colorability of planar graphs without adjacent cycles of given length ⋮ DP-\(4\)-colorability of planar graphs without intersecting \(5\)-cycles ⋮ Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable ⋮ On \((3, r)\)-choosability of some planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• List colourings of planar graphs
• Planar graphs without cycles of specific lengths
• Planar graphs without 4-cycles adjacent to triangles are 4-choosable
• 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
• 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 intersecting 5-cycles are 4-choosable