节点文献
图Pu,v（n）的邻强边染色
On adjacent strong edge colorly of graph Pu,v（n）
【摘要】 u,v两点间连接n条内部不相交的路,其中最多有一条长度为1,记做Pu,v(n)。给出一个算法,利用计算机寻找边染色的规律,进一步给出了Pu,v(n)的邻强边染色法,从而确定了Pu,v(n)的邻强边染色数。进一步讨论了至多含有两个顶点度大于2的部分简单连通图的邻强边色数。
【Abstract】 The Pu,v(n) is a simple graph consisting of n internally disjoint paths between a pair of vertexs of degree n.This paper gave an algorithm,and used computer to find edge coloring law,obtained the methods of the adjacent strong edge chromatic of Pu,v(n).So the adjacent strong edge chromatic number of Pu,v(n) was confirmed,and then discussed the adjacent strong edge chromatic number of a part of simple graph which had at most two vertexs of whose degree were greater than two.
【关键词】 邻强边色数；
k-边可着色；
顶点度；
【Key words】 adjacent strong edge chromatic number； k-edge colorable； degree of vertex；
【Key words】 adjacent strong edge chromatic number； k-edge colorable； degree of vertex；
【基金】 国家自然科学基金资助项目(60563008);广西自然科学基金资助项目(0728051)
- 【文献出处】 计算机应用研究 ,Application Research of Computers , 编辑部邮箱 ,2008年06期
- 【分类号】TP301
- 【被引频次】1
- 【下载频次】53