A sufficient condition for a planar graph to be 4-choosable

DOI10.1016/j.dam.2017.03.001zbMath1361.05035OpenAlexW2602322954MaRDI QIDQ526822

Renyu Xu, Jian Liang Wu

Publication date: 15 May 2017

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

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

zbMATH Keywords

planar graphcoloringchoosability

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

A new sufficient condition for a toroidal graph to be 4-choosable ⋮ A sufficient condition for planar graphs to be DP-4-colorable ⋮ Variable degeneracy on toroidal graphs ⋮ DP-4-coloring of planar graphs with some restrictions on cycles ⋮ Every planar graph without pairwise adjacent 3-, 4-, and 5-cycle is 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

Cites Work

• Unnamed Item
• 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 triangular 4-cycles are 3-choosable
• Planar Graphs without 7-Cycles Are 4-Choosable
• Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles

This page was built for publication: A sufficient condition for a planar graph to be 4-choosable