参考文献/References:
[1] 卢建立, 张志芳. 6连通图完美匹配上的可收缩边 [J]. 江西师范大学学报: 自然科学版, 2010, 34(6): 590-593.
[2] Bazgan C, Harkat?Benhamdine A, Li Hao, et al. On the vertex-distinguishing proper edge-colorings of graphs [J]. J Combin Theory: Series B, 1999, 75(2): 288-301.
[3] Burris A C, Schelp R H. Vertex-distinguishing proper edge-colorings [J]. J Graph Theory, 1997, 26(2): 73-82.
[4] 马刚, 张忠辅. 若干图的倍图的均匀邻强边染色 [J]. 纯粹数学与应用数学, 2010, 26(1): 64-68.
[5] Ma Gang, Ma Ming, Zhang Zhongfu. On the equitable total coloring of double graph of some graphs [J]. J Mathematical Study,
2009, 42(1): 40-44.
[6] Zhang Zhongfu, Liu Linzhong, Wang Jianfang. Adjacent strong edge coloring of graphs [J]. Applied Mathematics Letters, 2002, 15(5): 623-626.
[7] 田双亮, 李敬文, 张忠辅. 的均匀邻强边色数 [J]. 数学的实践与认识, 2006, 36(3): 244-248.
[8] Sheng Bau, Li Mingzhe, Liu Linzhong, et al. On the equitable adjacent strong edge chromatic number of [J]. Mathematics in Economics, 2002, 19(3): 15-18.
[9] Zhang Zhongfu, Qiu Pengxiang, Zhang Donghan, et a1.The double graph and the complement double graph of a graph [J]. Advances in Mathematics, 2008, 37(3): 303-310.
[10] 张忠辅, 李敬文, 赵传成, 等. 若干联图的点可区别均匀边色数 [J]. 数学学报: 中文版, 2007, 50(1): 197-204.