摘要
A total k-coloring of a graph G is a coloring of V（G） ∪ E（G） using k colors such that no two adjacent or incident elements receive the same color. The total chromatic number χ＇＇（G） is the smallest integer k such that G has a total k-coloring. It is known that if a planar graph G has maximum degree △≥ 9, then ）χ″（G） =△＋ 1. In this paper, we prove that if O is a planar graph with maximum degree 8 and without a fan of four adjacent 3-cycles, then χ″（G） =- 9.
A total k-coloring of a graph G is a coloring of V（G） ∪ E（G） using k colors such that no two adjacent or incident elements receive the same color. The total chromatic number χ＇＇（G） is the smallest integer k such that G has a total k-coloring. It is known that if a planar graph G has maximum degree △≥ 9, then ）χ″（G） =△＋ 1. In this paper, we prove that if O is a planar graph with maximum degree 8 and without a fan of four adjacent 3-cycles, then χ″（G） =- 9.
基金
Supported by Natural Science Foundation of Shandong Province(Grant No.ZR2013AM001)
