The bounded chromatic number for graphs of genus \(g\)

DOI10.1016/0095-8956(92)90017-RzbMath0774.05035MaRDI QIDQ1204466

Kenneth A. Berman, Jerome L. Paul

Publication date: 10 March 1993

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

pathchromatic numbergenuswalktrail

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
• Cubic irreducible graphs for the projective plane
• Every planar map is four colorable. I: Discharging
• Locally Planar Toroidal Graphs are 5-Colorable
• A 4-Color Theorem for Surfaces of Genus g

This page was built for publication: The bounded chromatic number for graphs of genus \(g\)