Neighbor Sum Distinguishing Total Choice Number of Planar Graphs without 6-cycles

被引：2

作者：

Dong Han ZHANG ^{[1
,2
]}

You LU ^{[1
]}

Sheng Gui ZHANG ^{[1
]}

机构：

[1] School of Mathematics and Statistics and Xi'an-Budapest Joint Research Center for Combinatorics,Northwestern Polytechnical University

[2] College of Mathematics and Computer Applications, Shangluo

来源：

Acta Mathematica Sinica | 2020年 / 36卷 / 12期

关键词：

D O I：

暂无

中图分类号：

O157.5 [图论];

学科分类号：

摘要：

Pil?niak and Wo?niak put forward the concept of neighbor sum distinguishing(NSD) total coloring and conjectured that any graph with maximum degree Δ admits an NSD total(Δ +3)-coloring in 2015. In 2016, Qu et al. showed that the list version of the conjecture holds for any planar graph with Δ≥ 13. In this paper, we prove that any planar graph with Δ≥ 7 but without 6-cycles satisfies the list version of the conjecture.

引用

页码：1417 / 1428

页数：12

共 50 条

[1] Neighbor Sum Distinguishing Total Choice Number of Planar Graphs without 6-cycles
Dong Han ZHANG
You LU
Sheng Gui ZHANG
Acta Mathematica Sinica,English Series, 2020, (12) : 1417 - 1428
[2] Neighbor Sum Distinguishing Total Choice Number of Planar Graphs without 6-cycles
Zhang, Dong Han
Lu, You
Zhang, Sheng Gui
ACTA MATHEMATICA SINICA-ENGLISH SERIES, 2020, 36 (12) : 1417 - 1428
[3] Neighbor Sum Distinguishing Total Choice Number of Planar Graphs without 6-cycles
Dong Han Zhang
You Lu
Sheng Gui Zhang
Acta Mathematica Sinica, English Series, 2020, 36 : 1417 - 1428
[4] Neighbor sum distinguishing total chromatic number of planar graphs without, 4-cycles
Ge, Shan
Li, Jianguo
Xu, Changqing
UTILITAS MATHEMATICA, 2017, 105 : 259 - 265
[5] NEIGHBOR SUM DISTINGUISHING TOTAL CHROMATIC NUMBER OF PLANAR GRAPHS WITHOUT 5-CYCLES
Zhao, Xue
Xu, Chang-Qing
DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2020, 40 (01) : 243 - 253
[6] Neighbor sum distinguishing total colorings of planar graphs without short cycles
Ma, Qiaoling
Wang, Jihui
Zhao, Haixia
UTILITAS MATHEMATICA, 2015, 98 : 349 - 359
[7] Neighbor sum distinguishing total coloring of planar graphs without 4-cycles
Hongjie Song
Changqing Xu
Journal of Combinatorial Optimization, 2017, 34 : 1147 - 1158
[8] Neighbor sum distinguishing total coloring of planar graphs without 5-cycles
Ge, Shan
Li, Jianguo
Xu, Changqing
THEORETICAL COMPUTER SCIENCE, 2017, 689 : 169 - 175
[9] Neighbor sum distinguishing total coloring of planar graphs without 4-cycles
Song, Hongjie
Xu, Changqing
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 34 (04) : 1147 - 1158
[10] Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
Wang, Jihui
Cai, Jiansheng
Ma, Qiaoling
DISCRETE APPLIED MATHEMATICS, 2016, 206 : 215 - 219

← 1 2 3 4 5 →