an:06600968
Zbl 1345.05035
Song, Hong Jie; Pan, Wen Hua; Gong, Xiang Nan; Xu, Chang Qing
A note on the neighbor sum distinguishing total coloring of planar graphs
EN
Theor. Comput. Sci. 640, 125-129 (2016).
00356673
2016
j
05C15 05C10
neighbor sum distinguishing total coloring; combinatorial Nullstellensatz; planar graph
Summary: Let \(G = (V(G), E(G))\) be a graph and \(\phi\) be a proper total \(k\)-coloring of \(G\). Let \(f(v)\) denote the sum of the color on a vertex \(v\) and colors on all the edges incident with \(v\). \(\phi\) is neighbor sum distinguishing if \(f(u) \neq f(v)\) for each edge \(u v \in E(G)\). The smallest integer \(k\) for which such a coloring of \(G\) exists is the neighbor sum distinguishing total chromatic number and denoted by \(\chi_{\Sigma}^{\prime\prime}(G)\). \textit{M. Pil??niak} and \textit{M. Wo??niak} [Graphs Comb. 31, No. 3, 771--782 (2015; Zbl 1312.05054)] conjectured that for any simple graph with maximum degree \(\Delta(G)\), \(\chi_{\Sigma}^{\prime\prime}(G) \leq \Delta(G) + 3\). It is known that for any simple planar graph, \(\chi_{\Sigma}^{\prime\prime}(G) \leq \max \{\Delta(G) + 3, 14 \}\) and \(\chi_{\Sigma}^{\prime\prime}(G) \leq \max \{\Delta(G) + 2, 16 \}\). In this paper, by using the famous Combinatorial Nullstellensatz, we show that for any simple planar graph, \(\chi_{\Sigma}^{\prime\prime}(G) \leq \max \{\Delta(G) + 2, 14 \}\). The bound \(\Delta(G) + 2\) is sharp.
Zbl 1312.05054