A new sufficient condition for a toroidal graph to be 4-choosable

DOI10.1016/j.disc.2018.06.041zbMath1393.05120OpenAlexW2883264415WikidataQ129557369 ScholiaQ129557369MaRDI QIDQ1660275

Danjun Huang, Jing Lv

Publication date: 15 August 2018

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

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

zbMATH Keywords

cyclechoosabilitytoroidal graph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• A sufficient condition for a planar graph to be 4-choosable
• List colourings of planar graphs
• Planar graphs without 4-cycles adjacent to triangles are 4-choosable
• The 4-choosability of toroidal graphs without intersecting triangles
• The 4-choosability of plane graphs without 4-cycles
• Every planar graph is 5-choosable
• Choosability of toroidal graphs without short cycles
• Dirac's map-color theorem for choosability
• Toroidal graphs containing neither nor 6‐cycles are 4‐choosable

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