Elsevier

Discrete Mathematics

Volume 307, Issue 22, 28 October 2007, Pages 2820-2825
Discrete Mathematics

On 3-colorable planar graphs without prescribed cycles☆

https://doi.org/10.1016/j.disc.2006.11.025Get rights and content
Under an Elsevier user license
open archive

Abstract

In this paper we prove that every planar graph without cycles of length 4, 5, 6 and 8 is 3-colorable.

Keywords

Coloring
Planar graph
Cycle

Cited by (0)

☆

Research supported partially by NSFC (No. 10471131) and ZJNSFC (No. Y604167).

Copyright © 2007 Elsevier B.V. All rights reserved.