Hits :

First Author : Lan Shen

Affiliation of Author(s): 数理与信息工程学院

Date of Publication : 2009-01-01

Document Type : 期刊

Journal : Applied Mathematics Letters

Volume: Vol.22

Issue : No.9

Page Number : 1369-1373

ISSN : 0893-9659

Translation or Not : no

Key Words : Planar;graph;Total;coloring;Maximum;degree;Intersecting;triangles;Discharging

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.