作者：Jian; Sheng; CAI; Chang; Chun; TENG; G...平面图最大度着色充分条件颜色色数整数
摘要：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 G is a planar graph with maximum degree 8 and without a fan of four adjacent 3-cycles, then χ’’(G) = 9.
注：因版权方要求，不能公开全文，如需全文，请咨询杂志社
