Adjacent vertex distinguishing total colorings of outerplanar graphs

被引：0

作者：

Yiqiao Wang

Weifan Wang

机构：

[1] Zhejiang Normal University,Department of Mathematics

来源：

Journal of Combinatorial Optimization | 2010年 / 19卷

关键词：

Adjacent vertex distinguishing total coloring; Outerplanar graph; Maximum degree;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

An adjacent vertex distinguishing total coloring of a graph G is a proper total coloring of G such that any pair of adjacent vertices are incident to distinct sets of colors. The minimum number of colors required for an adjacent vertex distinguishing total coloring of G is denoted by χ″a(G). In this paper, we characterize completely the adjacent vertex distinguishing total chromatic number of outerplanar graphs.

引用

页码：123 / 133

页数：10

共 20 条

[1] Appel K(1976)Every planar graph map is four colorable Bull Am Math Soc 82 711-712
[2] Haken W(2007)On the adjacent vertex distinguishing total coloring numbers of graphs with Δ=3 Discrete Math. 42 96-102
[3] Chen X(2006)Adjacent-vertex-distinguishing total chromatic number on 2-connected outeplane graph with Δ( J Lanzhou Univ Nat Sci 18 35-38
[4] Chen X(1975))≤4 J Comb Theory Ser B 3 25-30
[5] Zhang Z(1964)On the chromatic index of outerplanar graphs Diskret Anal 23 117-134
[6] Fiorini S(1968)On an estimate of the chromatic index of a Usp Mat Nauk 14 87-109
[7] Vizing V(2007)-graph J Comb Optim 22 236-242
[8] Vizing V(1999)Some unsolved problems in graph theory Acta Math Appl Sin 41 8-13
[9] Wang H(2005)On the adjacent vertex distinguishing total chromatic number of the graphs with Δ( Xibei Shifan Daxue Xuebao Ziran Kexue Ban 48 289-299
[10] Wang W(2005))=3 Sci China Ser A undefined undefined-undefined

← 1 2 →