Title of article
Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable Original Research Article
Author/Authors
Dingzhu Du، نويسنده , , Lan Shen، نويسنده , , Yingqian Wang، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
7
From page
2778
To page
2784
Abstract
The Total Coloring Conjecture, in short, TCC, says that every simple graph is image-totally-colorable where image is the maximum degree of the graph. Even for planar graphs this conjecture has not been completely settled yet. However, every planar graph with image has been proved to be image-totally-colorable. In this paper, we prove that planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable.
Keywords
Planar graph , Adjacent triangles , Total coloring , Maximum degree
Journal title
Discrete Applied Mathematics
Serial Year
2009
Journal title
Discrete Applied Mathematics
Record number
887213
Link To Document