图Pu,v(n)的邻强边染色  

On adjacent strong edge colorly of graph P_(u,v)(n)

作　　者：孔令峰[1] 苏文龙[2] 罗海鹏[3] 黎贞崇[3] 何建东[3] 

机构地区：[1]广西师范学院数学与计算机科学系,南宁530001 [2]梧州学院,广西梧州543002 [3]广西科学院,南宁530003

出　　处：《计算机应用研究》2008年第6期1685-1686,共2页Application Research of Computers

基　　金：国家自然科学基金资助项目(60563008);广西自然科学基金资助项目(0728051)

摘　　要：u,v两点间连接n条内部不相交的路,其中最多有一条长度为1,记做Pu,v(n)。给出一个算法,利用计算机寻找边染色的规律,进一步给出了Pu,v(n)的邻强边染色法,从而确定了Pu,v(n)的邻强边染色数。进一步讨论了至多含有两个顶点度大于2的部分简单连通图的邻强边色数。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-边可着色 顶点度 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]