Five-coloring graphs on the Klein bottle
Combinatorics
2012-01-26 v1
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.
Keywords
Cite
@article{arxiv.1201.5361,
title = {Five-coloring graphs on the Klein bottle},
author = {Nathan Chenette and Luke Postle and Noah Streib and Robin Thomas and Carl Yerger},
journal= {arXiv preprint arXiv:1201.5361},
year = {2012}
}
Comments
40 pages, 7 figures