摘要
利用穷举法和组合分析法讨论了图Dn,4的邻点可区别边染色和邻点可区别全染色,通过构造具体染色得到了图Dn,4的邻点可区别边色数和邻点可区别全色数。
The adjacent vertex distinguishing edge coloring and the adjacent vertex distinguishing total coloring of graph Dn,4are discussed by the exhaustion method and the combination analytic method. The adjacent vertex distinguishing edge chromatic number and the adjacent vertex distinguishing total chromatic number of graph Dn,4are gained by construction specific coloring in the paper.
出处
《江西科学》
2015年第1期59-60,69,共3页
Jiangxi Science
基金
陕西省教育厅专项科研计划项目(14JK1225)
商洛学院教育教学改革研究项目(14JYJX133)
商洛学院服务地方专项项目(14SKY-FWDF007)
关键词
穷举法
邻点可区别边染色
邻点可区别全染色
method of exhaustion
adjacent vertex distinguishing edge coloring
adjacent vertex distinguishing total coloring
