Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve

被引：1

作者：

Huo, Jingjing ^{[1
]}

Wang, Yiqiao ^{[2
]}

Wang, Weifan ^{[3
]}

Xia, Wenjing ^{[3
]}

机构：

[1] Hebei Univ Engn, Dept Math, Handan 056038, Peoples R China

[2] Beijing Univ Chinese Med, Sch Management, Beijing 100029, Peoples R China

[3] Zhejiang Normal Univ, Dept Math, Jinhua 321004, Zhejiang, Peoples R China

来源：

JOURNAL OF COMBINATORIAL OPTIMIZATION | 2020年 / 39卷 / 01期

关键词：

Planar graph; Neighbor-distinguishing total coloring; Discharging; Combinatorial Nullstellensatz; 05C15; TOTAL-CHROMATIC NUMBER;

D O I：

10.1007/s10878-019-00465-3

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

The neighbor-distinguishing total chromatic number chi a ''(G) of a graph G is the minimum number of colors required for a proper total coloring of G such that any two adjacent vertices have different sets of colors. In this paper, we show that if G is a planar graph with Delta=12, then 13 <=chi a ''(G)<= 14, and moreover chi a ''(G)=14 if and only if G contains two adjacent 12-vertices.

引用

页码：246 / 272

页数：27

共 17 条

[1] Combinatorial Nullstellensatz [J].

Alon, N .

COMBINATORICS PROBABILITY & COMPUTING, 1999, 8 (1-2) :7-29

[2] On the adjacent vertex distinguishing total coloring numbers of graphs with Δ=3 [J].

Chen, Xiang'en .

DISCRETE MATHEMATICS, 2008, 308 (17) :4003-4007

[3]

Cheng XH, 2017, J COMB OPTIM, V34, P383, DOI 10.1007/s10878-016-9995-x

[4] The adjacent vertex distinguishing total chromatic number [J].

Coker, Tom ;

Johannson, Karen .

DISCRETE MATHEMATICS, 2012, 312 (17) :2741-2750

[5] A note on the adjacent vertex distinguishing total chromatic number of graphs [J].

Huang, Danjun ;

Wang, Weifan ;

Yan, Chengchao .

DISCRETE MATHEMATICS, 2012, 312 (24) :3544-3546

[6]

[黄丹君 Huang DanJun], 2012, [中国科学. 数学, Scientia Sinica Mathematica], V42, P151

[7] Concise proofs for adjacent vertex-distinguishing total colorings [J].

Hulgan, Jonathan .

DISCRETE MATHEMATICS, 2009, 309 (08) :2548-2550

[8] A characterization for the neighbor-distinguishing total chromatic number of planar graphs with Δ=13 [J].

Huo, Jingjing ;

Wang, Weifan ;

Wang, Yiqiao .

DISCRETE MATHEMATICS, 2018, 341 (11) :3044-3056

[9] Adjacent vertex distinguishing total coloring of graphs with maximum degree 4 [J].

Lu, You ;

Li, Jiaao ;

Luo, Rong ;

Miao, Zhengke .

DISCRETE MATHEMATICS, 2017, 340 (02) :119-123

[10] AVD-total-chromatic number of some families of graphs with Δ(G)=3 [J].

Luiz, Atilio G. ;

Campos, C. N. ;

de Mello, C. P. .

DISCRETE APPLIED MATHEMATICS, 2017, 217 :628-638

← 1 2 →