Map Colour Theorems Related To the Heawood Colour Formula
From MaRDI portal
Cited in
(11)- On constructive methods in the theory of colour-critical graphs
- Logical reformulation of quantum mechanics. I: Foundations
- Hadwiger's conjecture for graphs on the Klein bottle
- Coloring Eulerian triangulations of the Klein bottle
- A map colour theorem for the union of graphs
- The proper vertex-disconnection of graphs
- Sulla tracciabilita' di grafi finiti su superficie compatte
- Remarks on a conjecture of Barát and Tóth
- Ore's conjecture on color-critical graphs is almost true
- Dirac's map-color theorem for choosability
- On the vertex Folkman numbers \(F_v(\underbrace{2,\dots,2}_R;R-1)\) and \(F_v(\underbrace{2,\dots,2}_R;R-2)\)
This page was built for publication: Map Colour Theorems Related To the Heawood Colour Formula
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3233714)