A note on the adjacent vertex distinguishing total chromatic number of graph

被引：0

作者：

Wang, Zhiwen ^{[1
]}

机构：

[1] Ningxia Univ, Sch Math & Comp Sci, Ningxia 750021, Yinchuan, Peoples R China

来源：

ADVANCED MATERIALS AND COMPUTER SCIENCE, PTS 1-3 | 2011年 / 474-476卷

关键词：

Series-parallel Graph; Adjacent vertex distinguishing total coloring;

D O I：

10.4028/www.scientific.net/KEM.474-476.2341

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

A total coloring of a simple graph G is called adjacent vertex distinguishing if for any two adjacent and distinct vertices u and v in G, the set of colors assigned to the vertices and the edges incident to u differs from the set of colors assigned to the vertices and the edges incident to v. In this paper we shall prove the series-parallel graph with maximum degree 3 and the series-parallel graph whose the number of edges is the double of maximum degree minus 1 satisfy the adjacent vertex distinguishing total coloring conjecture.

引用

页码：2341 / 2345

页数：5

共 50 条

[31] The adjacent vertex distinguishing total chromatic numbers of planar graphs with Δ=10
Cheng, Xiaohan
Wang, Guanghui
Wu, Jianliang
[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 34 (02) : 383 - 397
[32] On the adjacent vertex-distinguishing total chromatic numbers of the graphs with Δ (G) = 3
Haiying Wang
[J]. Journal of Combinatorial Optimization, 2007, 14 : 87 - 109
[33] On the adjacent vertex-distinguishing total chromatic numbers of the graphs with Δ(G)=3
Wang, Haiying
[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2007, 14 (01) : 87 - 109
[34] A note on adjacent vertex distinguishing colorings of graphs
Axenovich, M.
Harant, J.
Przybylo, J.
Sotak, R.
Voigt, M.
Weidelich, J.
[J]. DISCRETE APPLIED MATHEMATICS, 2016, 205 : 1 - 7
[35] Upper Bounds on the D(β)-Vertex-Distinguishing Total-Chromatic Number of Graphs
Liu Xin-sheng
Zhu Zhi-qiang
[J]. ARS COMBINATORIA, 2015, 119 : 403 - 411
[36] TOTAL CHROMATIC NUMBER OF A GRAPH
VIJAYADITYA, N
[J]. JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 1971, 3 (APR): : 405 - +
[37] Adjacent vertex distinguishing total colorings of graphs with four distinguishing constraints
Yang, Chao
Ren, Han
Yao, Bing
[J]. ARS COMBINATORIA, 2016, 127 : 197 - 208
[38] Adjacent vertex-distinguishing E-total coloring on the multiple join graph of complete graph and wheel
Li, Muchun
Zhang, Li
[J]. SENSORS, MEASUREMENT AND INTELLIGENT MATERIALS, PTS 1-4, 2013, 303-306 : 1605 - 1608
[39] Adjacent vertex distinguishing total colorings of outerplanar graphs
Yiqiao Wang
Weifan Wang
[J]. Journal of Combinatorial Optimization, 2010, 19 : 123 - 133
[40] Adjacent vertex distinguishing total coloring of corona products
Furmanczyk, Hanna
Zuazua, Rita
[J]. XII LATIN-AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM, LAGOS 2023, 2023, 224 : 382 - 384

← 1 2 3 4 5 →