Title of article
Total colorings of planar graphs without adjacent triangles
Author/Authors
Sun، نويسنده , , Xiangyong and Wu، نويسنده , , Jian-Liang and Wu، نويسنده , , Yu-Wen and Hou، نويسنده , , Jian-Feng، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
5
From page
202
To page
206
Abstract
Let G be a planar graph without adjacent 3-cycles, that is, two cycles of length 3 are not incident with a common edge. In this paper, it is proved that the total coloring conjecture is true for G ; moreover, if Δ ( G ) ≥ 9 , then the total chromatic number χ ″ ( G ) of G is Δ ( G ) + 1 . Some other related results are obtained, too.
Keywords
total coloring , Triangle , Planar graph
Journal title
Discrete Mathematics
Serial Year
2009
Journal title
Discrete Mathematics
Record number
1598477
Link To Document