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

DOI10.1016/J.DISC.2016.06.009zbMATH Open1343.05053OpenAlexW2478124327MaRDI QIDQ738863FDOQ738863

Authors: Panpan Cheng, Min Chen, Yingqian 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

Recommendations

• Planar graphs without triangular 4-cycles are 3-choosable
• Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable
• The 4-choosability of plane graphs without 4-cycles
• Planar graphs without intersecting 5-cycles are 4-choosable
• Edge choosability of planar graphs without small cycles

zbMATH Keywords

choosabilityplanar graphdischargingtriangular 4-cycle

Mathematics Subject Classification ID

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

Cites Work

• Graph theory
• Title not available (Why is that?)
• Every planar graph is 5-choosable
• List colourings of planar graphs
• The complexity of planar graph choosability
• Choosability and edge choosability of planar graphs without five cycles
• Planar Graphs without 7-Cycles Are 4-Choosable
• The 4-choosability of plane graphs without 4-cycles
• Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
• Planar graphs without cycles of specific lengths

Cited In (13)

• The 4-choosability of planar graphs and cycle adjacency
• Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
• A sufficient condition for planar graphs to be DP-4-colorable
• 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz
• A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable
• Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable
• DP-4-colorability of planar graphs without adjacent cycles of given length
• Planar graphs without triangular 4-cycles are 3-choosable
• Planar graphs without intersecting 5-cycles are 4-choosable
• A new sufficient condition for a toroidal graph to be 4-choosable
• Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable
• Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable
• On sufficient conditions for planar graphs to be 5-flexible

This page was built for publication: Planar graphs without 4-cycles adjacent to triangles are 4-choosable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q738863)