Vertex-Distinguishing E-Total Coloring of the Graphs $mC_{3}$ and $mC_{4}$
Received:January 01, 2009  Revised:January 28, 2010
Key Words: coloring   E-total coloring   vertex-distinguishing E-total coloring   vertex-distinguishing E-total chromatic number   the vertex-disjoint union of $m$ cycles with length $n$.  
Fund Project:Supported by the National Natural Science Foundation of China (Grant No.10771091) and the Scientific Research Project of Northwest Normal University (Grant No.NWNU-KJCXGC-03-61).
Author NameAffiliation
Xiang En CHEN College of Mathematics and Information Science, Northwest Normal University, Gansu 730070, P. R. China 
Yue ZU College of Mathematics and Information Science, Northwest Normal University, Gansu 730070, P. R. China 
Hits: 3303
Download times: 2198
Abstract:
      
Citation:
DOI:10.3770/j.issn:1000-341X.2011.01.005
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.