Toroidal graphs containing neither nor 6‐cycles are 4‐choosable

DOI10.1002/jgt.22054zbMath1365.05086arXiv1307.3293OpenAlexW2963168471MaRDI QIDQ5272640

Ilkyoo Choi

Publication date: 30 June 2017

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1307.3293

zbMATH Keywords

choosabilitytoroidal graphdischarging

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

A new sufficient condition for a toroidal graph to be 4-choosable ⋮ Vertex-arboricity of toroidal graphs without \(K_5^-\) and \(6\)-cycles

Cites Work

• Unnamed Item
• List colourings of planar 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
• Colorings of plane graphs: a survey
• Choosability of toroidal graphs without short cycles
• Planar Graphs without 7-Cycles Are 4-Choosable
• Dirac's map-color theorem for choosability

This page was built for publication: Toroidal graphs containing neither nor 6‐cycles are 4‐choosable