The 4-choosability of toroidal graphs without intersecting triangles

DOI10.1016/j.ipl.2006.11.005zbMath1185.05069OpenAlexW2090375754MaRDI QIDQ845970

Luo Xiaofang

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.11.005

zbMATH Keywords

cyclecombinatorial problemschoosabilitylist coloringtoroidal graph

Mathematics Subject Classification ID

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

Related Items

A new sufficient condition for a toroidal graph to be 4-choosable ⋮ DP-4-coloring of planar graphs with some restrictions on cycles ⋮ Entire coloring of graphs embedded in a surface of nonnegative characteristic ⋮ Cover and variable degeneracy

Cites Work

• Unnamed Item
• Unnamed Item
• List colourings of planar graphs
• Every planar graph is 5-choosable
• Choosability of toroidal graphs without short cycles
• Dirac's map-color theorem for choosability
• Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles