Vertex-Distinguishing Total Coloring of Graph Pm×P3(n=11+8k) and the Algorithm
(1.School of Information Science and Engineering,Lanzhou City University,Lanzhou 730070,China;2.Institute of Applied Mathematics,Lanzhou Jiaotong University,Lanzhou 730070,China)
BAO Shi-Tang, HAN Xiao-Hong, LI Mu-Chun, WEN Fei. Vertex-Distinguishing Total Coloring of Graph Pm×P3(n=11+8k) and the Algorithm[J]. journal6, 2011, 32(6): 5-10.
[1] BEHZAD M.Graphs and Their Chromatic Numbers [D].East Lasing:Michigan State University,1965.[2] ZHANG Zhong-fu,QIU Peng-xiang,XU Bao-gen,et al.Vertex-Distinguishing Total Coloring of Graphs [J].Ars Combinatoria,2008,87:33-45.[3] 张忠辅,李敬文,陈祥恩,等.图的距离不大于β的点可区别的全染色 [J].中国科学:数学,2006,36(10):1 119-1 130.[4] WANG Zhi-wen,YAN Li-hong,ZhANG Zhong-fu.Vertex Distinguishing Equitable Total Chromatic Number of Join Graph [J].Acta Mathematicae Applicatae Sinica:English Series,2007,23(3):445-450.[5] BAO Shi-tang,WANG Zhi-wen,WEN Fei.Vertex-Distinguishing Total Coloring of Ladder Graphs [C].ISIA2010:118-124.[6] 包世堂,杨茂军.梯图Lm(2<m≤ 37)的点可区别全染色 [J].西北师范大学学报:自然科学版,2010,46(5):16-18.[7] 包世堂,王治文,钟约夫,等.梯图的点可区别全染色(n≡2 (mod 8)) [J].福州大学学报:自然科学版,2010,38(6):782-788.[8] BAO Shi-tang,WANG Zhi-wen.Vertex-Distinguishing Total Coloring of Ladder Graphs (n≡ 3 (mod 8)) [C].ICCNT2011:193-196.[9] BONDY J A,MURTY U S R.Graph Theory [M].New York:Springer,2008.