Adjacent vertex distinguishing total colorings of outerplanar graphs

被引：56

作者：

Wang, Yiqiao ^{[1
]}

Wang, Weifan ^{[1
]}

机构：

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

来源：

JOURNAL OF COMBINATORIAL OPTIMIZATION | 2010年 / 19卷 / 02期

关键词：

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

D O I：

10.1007/s10878-008-9165-x

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

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 chi aEuro(3) (a) (G). In this paper, we characterize completely the adjacent vertex distinguishing total chromatic number of outerplanar graphs.

引用

页码：123 / 133

页数：11

共 11 条

[1] EVERY PLANAR MAP IS 4 COLORABLE [J].

APPEL, K ;

HAKEN, W .

BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1976, 82 (05) :711-712

[2]

Behzad M., 1965, Doctoral Thesis

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

Chen, Xiang'en .

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

[4]

[CHEN Xiangen 陈祥恩], 2006, [兰州大学学报. 自然科学版, Journal of Lanzhou University. Natural Science], V42, P96

[5] CHROMATIC INDEX OF OUTERPLANAR GRAPHS [J].

FIORINI, S .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 1975, 18 (01) :35-38

[6]

Vizing V. G., 1968, Uspekhi Mat. Nauk, V23, P117

[7]

Vizing V.G., 1964, Diskretn. Anal., V3, P25

[8] On the adjacent vertex-distinguishing total chromatic numbers of the graphs with Δ(G)=3 [J].

Wang, Haiying .

JOURNAL OF COMBINATORIAL OPTIMIZATION, 2007, 14 (01) :87-109

[9] How is maternal survival related to reproductive success? [J].

Wang, XT ;

Hertwig, R .

BEHAVIORAL AND BRAIN SCIENCES, 1999, 22 (02) :236-+

[10]

ZHANG S, 2005, XUEBAO ZIRAN KEXUE B, V41, P8

← 1 2 →