A 4-color theorem of the Klein bottle

DOI10.1016/0012-365X(89)90324-5zbMath0685.05019OpenAlexW2094144772MaRDI QIDQ1825877

R. Louise Woodburn

Publication date: 1989

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

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

zbMATH Keywords

chromatic numberKlein bottlegraph embeddings

Mathematics Subject Classification ID

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

Related Items

Three-coloring Klein bottle graphs of girth five

Cites Work

• Unnamed Item
• Unnamed Item
• 103 graphs that are irreducible for the projective plane
• A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger
• A 4-Color Theorem for Toroidal Graphs
• Some new algebraic methods in topology