Bull. Korean Math. Soc. 2016; 53(1): 139-151
Published online January 31, 2016 https://doi.org/10.4134/BKMS.2016.53.1.139
Copyright © The Korean Mathematical Society.
Shandong University of Finance and Economics
A $k$-total-coloring of a graph $G$ is a coloring of $V\cup E$ using $k$ colors such that no two adjacent or incident elements receive the same color. The total chromatic number $\chi''(G)$ of $G$ is the smallest integer $k$ such that $G$ has a $k$-total-coloring. Let $G$ be a planar graph with maximum degree $\Delta$. In this paper, it's proved that if $\Delta\geq 7$ and $G$ does not contain adjacent 5-cycles, then the total chromatic number $\chi''(G)$ is $\Delta+1$.
Keywords: planar graph, total coloring, adjacent 5-cycle
MSC numbers: 05C15
2022; 59(1): 27-43
2018; 55(2): 415-430
2017; 54(1): 331-342
2015; 52(4): 1305-1319
2022 © The Korean Mathematical Society. Powered by INFOrang Co., Ltd