An Upper Bound for the Adjacent Vertex-Distinguishing Total Chromatic Number of a Graph
Received:January 04, 2007  Revised:September 07, 2007
Key Words: total coloring   adjacent vertex distinguishing total coloring   adjacent vertex distinguishing total chromatic number   Lov\'{a}sz local lemma.  
Fund Project:the Natural Science Foundation of Gansu Province (No.3ZS051-A25-025); the Foundation of Gansu Provincial Department of Education (No.0501-03).
Author NameAffiliation
LIU Xin Sheng College of Mathematics and Information Science, Northwest Normal University, Gansu 730070, China 
AN Ming Qiang College of Science, Tianjin University of Science and Technology, Tianjin 300457, China 
GAO Yang College of Mathematics and Information Science, Northwest Normal University, Gansu 730070, China 
Hits: 7435
Download times: 2449
Abstract:
      
Citation:
DOI:10.3770/j.issn:1000-341X.2009.02.018
View Full Text  View/Add Comment  
  Copyright © Journal of Mathematical Research with Applications
Sponsored by：Dalian University of Technology, China Society for Industrial and Applied Mathematics
Address：No.2 Linggong Road, Ganjingzi District, Dalian City, Liaoning Province, P. R. China , Postal code ：116024
Service Tel：86-411-84707392 Email：jmre@dlut.edu.cn
Designed by Beijing E-tiller Co.,Ltd.
Due to security factors, early browsers cannot log in. It is recommended to log in with IE10, IE11, Google, Firefox, and 360 new browsers.