Document Type

Article

Publication Date

5-6-2009

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 K6 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. © 2008 Elsevier B.V. All rights reserved.

Publication Source (Journal or Book title)

Discrete Mathematics

First Page

2948

Last Page

2951

Download
COinS