General Vertex-Distinguishing Total Coloring of Graphs

被引：2

作者：

Liu, Chanjuan ^{[1
]}

Zhu, Enqiang ^{[1
]}

机构：

[1] Peking Univ, Sch Elect Engn & Comp Sci, Beijing 100871, Peoples R China

来源：

JOURNAL OF APPLIED MATHEMATICS | 2014年

基金：

中国国家自然科学基金;

关键词：

TOTAL CHROMATIC-NUMBERS; EDGE; AVDTC;

D O I：

10.1155/2014/849748

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The general vertex-distinguishing total chromatic number of a graph G is the minimum integer k, for which the vertices and edges of G are colored using k colors such that any two vertices have distinct sets of colors of them and their incident edges. In this paper, we figure out the exact value of this chromatic number of some special graphs and propose a conjecture on the upper bound of this chromatic number.

引用

页数：7

共 50 条

[41] On adjacent-vertex-distinguishing total coloring of graphs
ZHANG Zhongfu
Department of Computer
Institute of Applied Mathematics
College of Information and Electrical Engineering
Science China Mathematics, 2005, (03) : 289 - 299
[42] The adjacent vertex distinguishing total coloring of planar graphs
Wang, Weifan
Huang, Danjun
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2014, 27 (02) : 379 - 396
[43] Vertex-distinguishing edge colorings of graphs
Ballister, PN
Riordan, OM
Schelp, RH
JOURNAL OF GRAPH THEORY, 2003, 42 (02) : 95 - 109
[44] On Adjacent Vertex-distinguishing Total Chromatic Number of Generalized Mycielski Graphs
Zhu, Enqiang
Liu, Chanjuan
Xu, Jin
TAIWANESE JOURNAL OF MATHEMATICS, 2017, 21 (02): : 253 - 266
[45] Upper bounds for adjacent vertex-distinguishing edge coloring
Junlei Zhu
Yuehua Bu
Yun Dai
Journal of Combinatorial Optimization, 2018, 35 : 454 - 462
[46] On the adjacent vertex-distinguishing total chromatic numbers of the graphs with Δ(G)=3
Wang, Haiying
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2007, 14 (01) : 87 - 109
[47] On Adjacent Vertex-Distinguishing Total Chromatic Number of Generalized Petersen Graphs
Zhu, Enqiang
Jiang, Fei
Li, Zepeng
Shao, Zehui
Xu, Jin
2016 IEEE FIRST INTERNATIONAL CONFERENCE ON DATA SCIENCE IN CYBERSPACE (DSC 2016), 2016, : 230 - 234
[48] On the adjacent vertex-distinguishing total chromatic numbers of the graphs with Δ (G) = 3
Haiying Wang
Journal of Combinatorial Optimization, 2007, 14 : 87 - 109
[49] Upper bounds for adjacent vertex-distinguishing edge coloring
Zhu, Junlei
Bu, Yuehua
Dai, Yun
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2018, 35 (02) : 454 - 462
[50] Gap vertex-distinguishing edge colorings of graphs
Tahraoui, M. A.
Duchene, E.
Kheddouci, H.
DISCRETE MATHEMATICS, 2012, 312 (20) : 3011 - 3025

← 1 2 3 4 5 →