Hadwiger's conjecture for graphs on the Klein bottle
From MaRDI portal
Publication:1142782
DOI10.1016/0012-365X(90)90280-UzbMath0441.05026WikidataQ123219073 ScholiaQ123219073MaRDI QIDQ1142782
Michael O. Albertson, Joan P. Hutchinson
Publication date: 1980
Published in: Discrete Mathematics (Search for Journal in Brave)
Klein bottle; Hadwiger's conjecture; elementary contraction; every r-chromatic graph contracts to K(r); six-chromatic graphs
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Every planar map is four colorable. II: Reducibility
- Über eine Eigenschaft der ebenen Komplexe
- Map Colour Theorems Related To the Heawood Colour Formula
- Short Proof of a Map-Colour Theorem
- Map Colour Theorems Related to the Heawood Colour Formula (II)
- On Six-Chromatic Toroidal Graphs
- A Six Color Problem
- SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
- Map-Colour Theorems