Realizing the chromatic numbers of triangulations of surfaces

DOI10.1016/0012-365X(93)90295-5zbMath0791.05026OpenAlexW1983391995MaRDI QIDQ1313860

Frank Harary, S. A. Lavrenchenko, Vladimir P. Korzhik

Publication date: 1 March 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90295-5

zbMATH Keywords

chromatic numbertriangular imbeddingclosed 2-manifold

Mathematics Subject Classification ID

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

Related Items

Polyhedral suspensions of arbitrary genus

Cites Work

• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Parallel concepts in graph theory
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
• Bestimmung der Maximalzahl der Nachbargebiete auf nicht-orientierbaren Flächen
• Unnamed Item
• Unnamed Item