标题：Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
作者：Wang, B.;Wu, J.-L.
作者机构：School of Mathematics, Shandong University, Jinan, 250100, China;School of Mathematics, Shandong University, Jinan, 250100, Chin
关键词：Cycle;Planar graph;Total coloring
摘要：Let G be a planar graph with maximum degree Δ≥7 and without intersecting 3-cycles; that is, two cycles of length 3 are not incident with a common vertex. Then the total chromatic number of G is Δ+1.