论文信息 - On the adjacent vertex distinguishing total coloring numbers of graphs with Delta=3

On the adjacent vertex distinguishing total coloring numbers of graphs with Delta=3

An adjacent vertex distinguishing total-coloring of a simple graph G is a proper total-coloring of G such that no pair of adjacent vertices meets the same set of colors. The minimum number of colors @g"a^''(G) required to give G an adjacent vertex distinguishing total-coloring is studied. We proved @g"a^''(G)=<6 for graphs with maximum degree @D(G)=3 in this paper.

Xiangen Chen

[1] Jianfang Wang,et al. Adjacent strong edge coloring of graphs , 2002, Appl. Math. Lett..

[2] P. Balister,et al. Vertex-distinguishing edge colorings of graphs , 2003 .

[3] Saieed Akbari,et al. r-Strong edge colorings of graphs , 2006, Discret. Math..

[4] B. Yao,et al. On adjacent-vertex-distinguishing total coloring of graphs , 2005 .

[5] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[6] Hao Li,et al. On the Vertex-Distinguishing Proper Edge-Colorings of Graphs , 1999, J. Comb. Theory B.

[7] Haiying Wang,et al. On the adjacent vertex-distinguishing total chromatic numbers of the graphs with Δ (G) = 3 , 2007, J. Comb. Optim..

[8] Hamed Hatami,et al. Delta+300 is a bound on the adjacent vertex distinguishing edge chromatic number , 2005, J. Comb. Theory, Ser. B.

[9] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[10] Richard H. Schelp,et al. Adjacent Vertex Distinguishing Edge-Colorings , 2007, SIAM J. Discret. Math..