A Six Color Problem
From MaRDI portal
Cited in
(16)- Nonorientable biembeddings of Steiner triple systems
- Neighborly combinatorial 3-manifolds with 9 vertices
- On dynamic coloring for planar graphs and graphs of higher genus
- Neighborly maps with few vertices
- Hadwiger's conjecture for graphs on the Klein bottle
- Euler's formula for general graph embeddings
- Some Conjectures and Questions in Chromatic Topological Graph Theory
- Vertex-minimal simplicial immersions of the Klein bottle in three space
- Dirac's map-color theorem for choosability
- scientific article; zbMATH DE number 4047749 (Why is no real title available?)
- On the dichromatic number of surfaces
- Nordhaus–Gaddum‐type Theorems for decompositions into many parts
- Remarks on the Heawood conjecture (nonorientable case)
- The four color theorem and its aftermath
- Tight polyhedral Klein bottles, projective planes, and Möbius bands
- The last excluded case of Dirac's map‐color theorem for choosability
This page was built for publication: A Six Color Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4758785)