Publication:4719323
From MaRDI portal
DOI<327::AID-JGT2>3.0.CO;2-B 10.1002/(SICI)1097-0118(199912)32:4<327::AID-JGT2>3.0.CO;2-BzbMath0941.05025MaRDI QIDQ4719323
Bojan Mohar, Michael Stiebitz, Thomas Böhme
Publication date: 3 August 2000
05C15: Coloring of graphs and hypergraphs
Cites Work
- List colourings of planar graphs
- Every planar graph is 5-choosable
- The colour theorems of Brooks and Gallai extended
- Color-critical graphs on a fixed surface
- Map Colour Theorems Related To the Heawood Colour Formula
- A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger
- Short Proof of a Map-Colour Theorem
- A Six Color Problem
- SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
- Bestimmung der Maximalzahl der Nachbargebiete auf nicht-orientierbaren Flächen