On the adjacent-vertex-strongly-distinguishing total coloring of graphs

Science in China, Series A: Mathematics

Volumn 51, Issue 3, 2008, Pages 427-436

  Zhang, ZhongFu ^a,b   Cheng, Hui ^a   Yao, Bing ^a   Li, JingWen ^b   Chen, XiangEn ^a   Xu, BaoGen ^c  

^a NORTHWEST NORMAL UNIVERSITY   (China)

^b LANZHOU JIAOTONG UNIVERSITY   (China)

^c EAST CHINA JIAOTONG UNIVERSITY   (China)

Author keywords

Adjacent vertex strongly distinguishing total coloring; Proper coloring; Simple connected graph

Indexed keywords

EID: 38949206370     PISSN: 10069283     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11425-007-0128-y     Document Type: Article

References (7)

1. Bondy A, Murty U S R. Graph Theory with Applications. New York: Macmillan Press, 1976
2. Burris A C, Schelp R H. Vertex-distinguishing proper edge-coloring. J Graph Theory, 26(2): 70-82 (1997)
3. Burris A C. Vertex-distinguishing edge-colorings. PhD Dissertation. Memphis: Memphis State University, 1993
4. Favaron O, Li H, Schelp R H. Strong edge coloring of graphs. Discrete Math, 159: 103-109 (1996)
5. Balister P N, Bollobás B, Schelp R H. Vertex distinguishing colorings of graphs with Δ(G) = 2. Discrete Math, 252: 17-29 (2002)
6. Zhang Z F, Chen X E, Li J W, et al. On the adjacent vertex distinguishing total coloring of graphs. Sci China Ser A-Math, 48(3): 289-299 (2005)
7. Zhang Z F, Liu L Z, Wang J F. Adjacent strong edge coloring of graphs. Appl Math Lett, 15: 623-626 (2002)