Title of article
A note on the total coloring of planar graphs without adjacent 4-cycles
Author/Authors
Wang، نويسنده , , Hui-Juan and Wu، نويسنده , , Jian-Liang، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2012
Pages
4
From page
1923
To page
1926
Abstract
Let G be a planar graph with maximum degree Δ ≥ 7 and without adjacent 4-cycles, that is, two cycles of length 4 do not share one common edge. Then its total chromatic number is Δ + 1 .
Keywords
total coloring , Planar graph , cycle
Journal title
Discrete Mathematics
Serial Year
2012
Journal title
Discrete Mathematics
Record number
1599998
Link To Document