Title of article
On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles
Author/Authors
Shen، نويسنده , , Lan and Wang، نويسنده , , Yingqian and Wang، نويسنده , , Weifan and Lih، نويسنده , , Ko-Wei، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
5
From page
1369
To page
1373
Abstract
Recently, Kowalik, Sereni, and Škrekovski proved that planar graphs with maximum degree 9 are 10-totally colorable. This work proves that planar graphs with maximum degree 8 and without intersecting triangles are 9-totally colorable.
Keywords
Discharging , Planar graph , total coloring , maximum degree , Intersecting triangles
Journal title
Applied Mathematics Letters
Serial Year
2009
Journal title
Applied Mathematics Letters
Record number
1526214
Link To Document