Planar graphs without 4-cycles adjacent to triangles are 4-choosable

DOI10.1016/j.disc.2016.06.009zbMath1343.05053OpenAlexW2478124327MaRDI QIDQ738863

Panpan Cheng, Min Chen, Ying Qian Wang

Publication date: 16 August 2016

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

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

zbMATH Keywords

planar graphchoosabilitydischargingtriangular 4-cycle

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (9)

Planar graphs without intersecting 5-cycles are 4-choosable ⋮ A new sufficient condition for a toroidal graph to be 4-choosable ⋮ A sufficient condition for planar graphs to be DP-4-colorable ⋮ Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable ⋮ The 4-choosability of planar graphs and cycle adjacency ⋮ Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable ⋮ DP-4-colorability of planar graphs without adjacent cycles of given length ⋮ Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable ⋮ On sufficient conditions for planar graphs to be 5-flexible

Cites Work

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