Five-coloring graphs on the Klein bottle
classification
🧮 math.CO
keywords
bottlegraphskleinlistcolorabledrawnexhibitexplicit
read the original abstract
We exhibit an explicit list of nine graphs such that a graph drawn in the Klein bottle is 5-colorable if and only if it has no subgraph isomorphic to a member of the list.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.