# zbMATH — the first resource for mathematics

Neighbor sum distinguishing total choice number of planar graphs without 6-cycles. (English) Zbl 07314972
Summary: M. Pilśniak and M. Woźniak [Graphs Comb. 31, No. 3, 771–782 (2015; Zbl 1312.05054)] put forward the concept of neighbor sum distinguishing (NSD) total coloring and conjectured that any graph with maximum degree $$\Delta$$ admits an NSD total $$(\Delta+3)$$-coloring. C. Qu et al. [J. Comb. Optim. 32, No. 3, 906–916 (2016; Zbl 1348.05082)] showed that the list version of the conjecture holds for any planar graph with $$\Delta\geq 13$$. In this paper, we prove that any planar graph with $$\Delta\geq 7$$ but without 6-cycles satisfies the list version of the conjecture.
##### MSC:
 05C15 Coloring of graphs and hypergraphs 05C10 Planar graphs; geometric and topological aspects of graph theory
Full Text:
##### References:
 [1] Alon, N., Combinatorial nullstellensatz, Combin. Probab. Comput., 8, 7-29 (1999) · Zbl 0920.05026 [2] Bondy, J. A., Murty, U. S. R.: Graph Theory. GTM, Vol. 244, Springer, 2008 · Zbl 1134.05001 [3] Ge, S.; Li, J.; Xu, C., Neighbor sum distinguishing total coloring of planar graphs without 5-cycles, Theoret. Comput. Sci., 689, 169-175 (2017) · Zbl 1372.05072 [4] Han, M.; Lu, Y.; Luo, R., Neighbor sum distinguishing total coloring of graphs with bounded treewidth, J. Comb. Optim., 36, 23-34 (2018) · Zbl 1396.05039 [5] Li, H.; Ding, L.; Liu, B., Neighbor sum distinguishing total colorings of planar graphs, J. Comb. Optim., 30, 675-688 (2015) · Zbl 1325.05083 [6] Lu, Y.; Han, M.; Luo, R., Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring, Discrete Appl. Math., 237, 109-115 (2018) · Zbl 1380.05076 [7] Li, H.; Liu, B.; Wang, G., Neighbor sum distinguishing total coloring of K4-minor-free graphs, Front. Math. China, 8, 1351-1366 (2013) · Zbl 1306.05066 [8] Lu, Y.; Xu, C.; Miao, Z., Neighbor sum distinguishing list total coloring of subcubic graphs, J. Comb. Optim., 35, 778-793 (2018) · Zbl 1387.05094 [9] Pilsniak, M.; Wozniak, M., On the total-neighbor-distinguishing index by sums, Graphs Comb., 31, 771-782 (2015) · Zbl 1312.05054 [10] Qu, C.; Ding, L.; Wang, G., Neighbor distinguishing total choice number of sparse graphs via the Combinatorial Nullstellensatz, Acta Math. Sin. (Engl. Ser.), 32, 537-548 (2016) · Zbl 1336.05046 [11] Qu, C.; Wang, G.; Yan, G., Neighbor sum distinguishing total choosability of planar graphs, J. Comb. Optim., 32, 906-916 (2016) · Zbl 1348.05082 [12] Song, W.; Miao, L.; Li, J., Neighbor sum distinguishing total coloring of sparse IC-planar graphs, Discrete Appl. Math., 239, 183-192 (2018) · Zbl 1382.05019 [13] Wang, J.; Cai, J.; Ma, Q., Neighbor sum distinguishing total choosability ofplanar graphs without 4-cycles, Discrete Appl. Math., 206, 215-219 (2016) · Zbl 1335.05051 [14] Xu, C.; Ge, S.; Li, J., Neighbor sum distinguishing total chromatic number of2-degenerate graphs, Discrete Appl. Math., 251, 349-352 (2018) · Zbl 1401.05128 [15] Xu, C.; Li, J.; Ge, S., Neighbor sum distinguishing total chromatic number of planar graphs, Appl. Math. Comput., 332, 189-196 (2018) · Zbl 1427.05093 [16] Yang, D.; Sun, L.; Yu, X., Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10, Appl. Math. Comput., 314, 456-468 (2017) · Zbl 1426.05051 [17] Yao, J.; Yu, X.; Wang, G., Neighbor sum (set) distinguishing total choosability of d-degenerate graphs, Graphs Comb., 32, 1611-1620 (2016) · Zbl 1342.05052
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.