an:06485835
Zbl 1325.05083
Li, Hualong; Ding, Laihao; Liu, Bingqiang; Wang, Guanghui
Neighbor sum distinguishing total colorings of planar graphs
EN
J. Comb. Optim. 30, No. 3, 675-688 (2015).
00348273
2015
j
05C15 05C10 05C35 05C07
neighbor sum distinguishing total coloring; planar graph; maximum degree
Summary: A total \([k]\)-coloring of a graph \(G\) is a mapping \(\phi : V (G) \cup E(G)\to [k]=\{1, 2, \dots, k\}\) such that any two adjacent or incident elements in \(V (G) \cup E(G)\) receive different colors. Let \(f(v)\) denote the sum of the color of a vertex \(v\) and the colors of all incident edges of \(v\). A total \([k]\)-neighbor sum distinguishing-coloring of \(G\) is a total \([k]\)-coloring of \(G\) such that for each edge \(uv\in E(G)\), \(f(u)\neq f(v)\). By \(\chi ^{\prime\prime}_{nsd}(G)\), we denote the smallest value \(k\) in such a coloring of \(G\). \textit{M. Pil??niak} and \textit{M. Wo??niak} [``On the adjacent-vertex-distinguishing index by sums in total proper colorings'', Preprint] conjectured \(\chi_{nsd}^{\prime\prime}(G)\leq \Delta (G)+3\) for any simple graph with maximum degree \(\Delta (G)\). In this paper, we prove that this conjecture holds for any planar graph with maximum degree at least 13.