A 4-Color Theorem for Surfaces of Genus g

DOI10.2307/2046972zbMath0672.05028OpenAlexW4242247639MaRDI QIDQ3824328

Kenneth A. Berman, Jerome L. Paul

Publication date: 1989

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2046972

zbMATH Keywords

vertex coloringbounded chromatic numberplanar graphtoroidal graphgenus of a graphbounded path chromatic number

Mathematics Subject Classification ID

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

Related Items (3)

Nonrepetitive colorings of graphs -- a survey ⋮ The bounded chromatic number for graphs of genus \(g\) ⋮ Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths

This page was built for publication: A 4-Color Theorem for Surfaces of Genus g