Map-Colour Theorems
From MaRDI portal
Cited in
(26)- Hadwiger's conjecture for graphs on the Klein bottle
- Clean triangulations
- The choice number versus the chromatic number for graphs embeddable on orientable surfaces
- The chromatic numbers of double coverings of a graph
- Note on 4-coloring 6-regular triangulations on the torus
- Extending colorings of locally planar graphs
- Chromatic numbers of quadrangulations on closed surfaces
- Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle.
- Choosability of toroidal graphs without short cycles
- Paths and circuits in graphs: Extreme cases
- K6-minors in triangulations and complete quadrangulations
- Sulla tracciabilita' di grafi finiti su superficie compatte
- Remarks on a conjecture of Barát and Tóth
- Cochromatic Number and the Genus of a Graph
- Note on the cochromatic number of several surfaces
- The embeddings of a graph—A survey
- Hyperbolic families and coloring graphs on surfaces
- Grünbaum colorings of toroidal triangulations
- -Minors in triangulations on surfaces
- Six-Critical Graphs on the Klein Bottle
- Bestimmung der Maximalzahl der Nachbargebiete auf nicht-orientierbaren Flächen
- The four color theorem and its aftermath
- Coloring vertices and faces of maps on surfaces
- Five-coloring graphs on the Klein bottle
- Connectedness and structure in graphs
- Chromatic numbers of simplicial manifolds
This page was built for publication: Map-Colour Theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5813705)