| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657007 | Journal of Combinatorial Theory, Series B | 2012 | 32 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
