A Five-Color Theorem for Graphs on Surfaces

DOI10.2307/2044501zbMATH Open0536.05022OpenAlexW4245849179MaRDI QIDQ3320404FDOQ3320404

Authors: Joan P. Hutchinson 

Publication date: 1984

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

Recommendations

• Extending colorings of locally planar graphs
• Five-coloring graphs on the torus
• Color-critical graphs on a fixed surface
• Coloring graphs without short non-bounding cycles
• The number of \(k\)-colorings of a graph on a fixed surface

zbMATH Keywords

vertex-coloringedge-length2-cell imbedding

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Five-list-coloring graphs on surfaces. II: A linear bound for critical graphs in a disk.
• Five-coloring graphs on the torus
• Extending precolorings of subgraphs of locally planar graphs
• (1,k)-Coloring of Graphs with Girth at Least Five on a Surface
• Extending colorings of locally planar graphs

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

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