Coloring graphs with crossings
Combinatorics
2007-05-23 v1
Abstract
We generalize the Five Color Theorem by showing that it extends to graphs with two crossings. Furthermore, we show that if a graph has three crossings, but does not contain K_6 as a subgraph, then it is also 5-colorable. We also consider the question of whether the result can be extended to graphs with more crossings.
Cite
@article{arxiv.math/0501427,
title = {Coloring graphs with crossings},
author = {Bogdan Oporowski and David Zhao},
journal= {arXiv preprint arXiv:math/0501427},
year = {2007}
}
Comments
5 pages