[1] ZHANG Z, LIU L, WANG J. Adjacent strong edge coloring of graphs[J]. Applied Mathematics Letters, 2002, 15(5):623-626. [2] ZHANG Z, QIU P, XU B, et al. Vertex-distinguishing total coloring of graphs[J]. Ars Combinatoria, 2008, 87:33-45. [3] BURRIS A C. Vertex-distinguishing edge-colorings[D]. Memphis:Memphis State University, 1993:1-9. [4] ZHANG Z, CHEN X, LI J, et al. On adjacent-vertex-distinguishing total coloring of graphs[J]. Science in China Series A:Mathematics, 2005, 48(3):289-299. [5] 王双莉,张荔,李沐春.若干冠图的邻点可区别的V-全染色[J].兰州交通大学学报,2012,31(4):138-141. (WANG S L, ZHANG L, LI M C. The adjacent vertex distinguishing V-total coloring of some corona graphs[J]. Journal of Lanzhou Jiaotong University, 2012, 31(4):138-141.). [6] 马刚.一些积图的点可区别均匀边色数[J].数学杂志,2014,34(5):1005-1009. (MA G. On the vertex-distinguishing-equitable edge charomatic number of some product graphs[J]. Journal of Mathematics, 2014, 34(5):1005-1009.). [7] 林锉云,董家礼.多目标优化的方法与理论[M].长春:吉林教育出版社,1992:1-16. (LIN C Y, DONG J L. Multi-objective Optimization Method and Theory[M]. Changchun:Jilin Education Publishing House, 1992:1-16.). [8] 严谦泰,姚艳红.图的一般邻点可区别均匀边染色和均匀全染色[J].数学的实践与认识,2015,45(10):179-184. (YAN Q T, YAO Y H. On the adjacent spectral radius of cycles with fixed weight sets[J]. Mathematics in Practice and Theory, 2015, 45(10):179-184.). [9] 宋慧敏,龙和平,吴建良.Halin图的均匀边染色[J].山东大学学报:理学版,2003,38(2):32-34,46. (SONG H M, LONG H P, WU J L. The equitable edge-coloring of Halin graphs[J]. Journal of Shandong University (Natural Science), 2003, 38(2):32-34, 46.). [10] BONDY J A, MURTY S R. Graph Theory with Applications[M]. Oxford, UK:Elsevier Science, 1976:10-35. [11] 马小姝,李宇龙,严浪.传统多目标优化方法和多目标遗传算法的比较综述[J].电气传动自动化,2010, 32(3):48-50, 53. (MA X S, LI Y L, YAN L. Comparsion review of traditional multi-objective optimization methods and multi-objective genetic algorithm[J]. Electrical Drive Automation, 2010, 32(3):48-50, 53.). [12] 李世玲,陈祥恩,王治文.完全二部图K3,n(3≤n≤17)的点可区别E-全染色[J].吉林大学学报(理学版),2015,53(6):1171-1176. (LI S L, CHEN X E, WANG Z W. Vertex-distinguishing E-total coloring of complete bipartite graph K3,nwith 3≤n≤17[J]. Journal of Jilin University (Science Edition), 2015, 53(6):1171-1176.). [13] 孟献青.立方图的邻点可区别全染色及一般邻点可区别全染色[J].内蒙古师范大学学报(自然科学汉文版),2015,44(1):4-7,11. (MENG X Q. On the neighbor-distinguishing total coloring and the general neighbor-distinguishing total coloring of cubic chart[J]. Journal of Inner Mongolia Normal University (Natural Science Edition), 2015, 44(1):4-7, 11.). [14] 刘秀丽.若干Mycielski图的邻点可区别V-全染色[J].西南师范大学学报(自然科学版),2015,40(12):12-16. (LIU X L. Adjacent vertex-distinguishing V-total coloring on some Mycielski's graphs[J]. Journal of Southwest China Normal University (Natural Science Edition), 2015, 40(12):12-16.). [15] 卢永红,康淑瑰,孟献青,等.若干冠图的邻点可区别V-全染色[J].数学的实践与认识,2014,44(8):170-179. (LU Y H, KANG S G, MENG X Q, et al. Adjacent vertex-distinguishing V-total coloring of several categories of corona graphs[J]. Mathematics in Practice and Theory, 2014, 44(8):170-179.). [16] 杨超,姚兵,王宏宇,等.小度数图的邻点可区别全染色[J].数学杂志,2014,34(2):295-302.(YANG C, YAO B, WANG H Y, et al. Adjacent vertex distinguishing total colorings of graphs with smaller degrees[J]. Journal of Mathematics, 2014, 34(2):295-302.) |