The 4-choosability of toroidal graphs without intersecting triangles
From MaRDI portal
Publication:845970
DOI10.1016/j.ipl.2006.11.005zbMath1185.05069MaRDI QIDQ845970
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
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
Related Items
A new sufficient condition for a toroidal graph to be 4-choosable, Entire coloring of graphs embedded in a surface of nonnegative characteristic
Cites Work