The adjacent vertex distinguishing total coloring of planar graphs |
| |
Authors: | Weifan Wang Danjun Huang |
| |
Institution: | 1. Department of Mathematics, Zhejiang Normal University, Jinhua, 321004, China
|
| |
Abstract: | An adjacent vertex distinguishing total coloring of a graph G is a proper total coloring of G such that any pair of adjacent vertices have distinct sets of colors. The minimum number of colors needed for an adjacent vertex distinguishing total coloring of G is denoted by $\chi''_{a}(G)$ . In this paper, we characterize completely the adjacent vertex distinguishing total chromatic number of planar graphs G with large maximum degree Δ by showing that if Δ≥14, then $\varDelta+1\leq \chi''_{a}(G)\leq \varDelta+2$ , and $\chi''_{a}(G)=\varDelta+2$ if and only if G contains two adjacent vertices of maximum degree. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|