A 4-Color Theorem for Surfaces of Genus g
From MaRDI portal
Publication:3824328
DOI10.2307/2046972zbMath0672.05028MaRDI 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
vertex coloring; bounded chromatic number; planar graph; toroidal graph; genus of a graph; bounded path chromatic number
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
Related Items
Nonrepetitive colorings of graphs -- a survey, The bounded chromatic number for graphs of genus \(g\)