A 4-Color Theorem for Surfaces of Genus g

DOI10.2307/2046972zbMATH Open0672.05028OpenAlexW4242247639MaRDI QIDQ3824328FDOQ3824328

Authors: 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

Recommendations

• The bounded chromatic number for graphs of genus \(g\)
• scientific article; zbMATH DE number 4089589
• Coloring graphs with fixed genus and girth
• Coloring graphs without short non-bounding cycles
• Extending colorings of locally planar graphs

zbMATH Keywords

planar graphtoroidal graphvertex coloringgenus of a graphbounded chromatic numberbounded path chromatic number

Mathematics Subject Classification ID

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

Cited In (5)

• A ``nice map colour theorem
• Splitting planar graphs of girth 6 into two linear forests with short paths
• Nonrepetitive colorings of graphs -- a survey
• The bounded chromatic number for graphs of genus \(g\)
• 7-critical graphs of bounded genus

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3824328)