吉林大学学报（理学版）2009，Vol.47Issue(6)：1160-1164,5.
若干倍图的邻点可区别均匀全染色
On Adjacent Vertex-distinguishing-equitable Total Coloring of Double Graphs
摘要
Abstract
We studied adjacent vertex-distinguishing-equitable total coloring ( AVDETC) of some double graphs, and developed the adjacent vertex-distinguishing-equitable total chromatic numbers of double graphs of even order complete graph, even order cycle, path, star and wheel using constructive method and matching method, which satisfies the conjecture on AVDETCC.关键词
倍图/邻点可区别均匀全染色/邻点可区别均匀全色数Key words
double graph/ adjacent vertex-distinguishing-equitable total coloring/ adjacent vertex-distinguishing-equitable total chromatic number分类
数理科学引用本文复制引用
马刚,张忠辅..若干倍图的邻点可区别均匀全染色[J].吉林大学学报（理学版）,2009,47(6):1160-1164,5.基金项目
国家自然科学基金(批准号: 40301037)、国家民委科研项目基金(批准号: 05XB07)和西北民族大学中青年科研基金(批准号: X2007-012). （批准号: 40301037）
