A Five-Color Theorem for Graphs on Surfaces

DOI10.2307/2044501zbMath0536.05022OpenAlexW4245849179MaRDI QIDQ3320404

Joan P. Hutchinson

Publication date: 1984

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

zbMATH Keywords

edge-lengthvertex-coloring2-cell imbedding

Mathematics Subject Classification ID

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

Related Items (1)

Extending precolorings of subgraphs of locally planar graphs

Cites Work

• Grötzsch's theorem on 3-colorings
• A separator theorem for graphs of bounded genus
• Graph Theory and Probability. II
• Locally Planar Toroidal Graphs are 5-Colorable
• Every planar map is four colorable
• On the independence ratio of a graph
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
• A 4-Color Theorem for Toroidal Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Five-Color Theorem for Graphs on Surfaces