Article ID Journal Published Year Pages File Type
1709253 Applied Mathematics Letters 2009 5 Pages PDF
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
Related Topics
Physical Sciences and Engineering Engineering Computational Mechanics
Preview
On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles
Authors
, , , ,