Title of article
Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
Author/Authors
Wang، نويسنده , , Bing and Wu، نويسنده , , Jian-Liang، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
6
From page
2025
To page
2030
Abstract
Let G be a planar graph with maximum degree Δ ≥ 7 and without intersecting 3-cycles; that is, two cycles of length 3 are not incident with a common vertex. Then the total chromatic number of G is Δ + 1 .
Keywords
total coloring , Planar graph , cycle
Journal title
Discrete Mathematics
Serial Year
2011
Journal title
Discrete Mathematics
Record number
1598421
Link To Document