Title of article
On 3-colorable planar graphs without prescribed cycles Original Research Article
Author/Authors
Weifan Wang، نويسنده , , Min Chen، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
6
From page
2820
To page
2825
Abstract
In this paper we prove that every planar graph without cycles of length 4, 5, 6 and 8 is 3-colorable.
Keywords
Coloring , Cycle , Planar graph
Journal title
Discrete Mathematics
Serial Year
2007
Journal title
Discrete Mathematics
Record number
947622
Link To Document