广义图K(n,m)的全色数(英文)The total chromatic number of general graphs K(n,m)
王淑栋,陈东灵,庞善臣
摘要(Abstract)：
196 5年 ,M.Behzad和 Vizing分别提出了著名的全着色猜想 :即对于简单图 G有 :XT( G)≤Δ + 2 ,其中Δ是图 G的最大度 .本文确定了完全图 Kn的广义图 K( n,m)的全色数 ,并利用它证明了 Lm× Kn( m≥ 3)是第 I型的 .
关键词(KeyWords)： 广义图K(n,m);全着色;全色数;笛卡尔积图
基金项目(Foundation):
作者(Author): 王淑栋,陈东灵,庞善臣
参考文献(References)：
- [1] BondyJA,MurtyU S R.Graph theory with application[M].NewYork:Macmillan,1976
- [2] BehzadM.Graph and their chromatic number[D].Michigan:MichiganStateUniversity,1965
- [3] VijaydityaN.On ttotal chromatic number of a graph[J].J.L ondon.Math.Soc.1971,3(2):405-408
- [4] BollobasB,HarrisA J.L ist coloring of graphs[J].Graphs andComi.,1985,(1):115-127
- [5] ZhangZhongfu,ZhangJianxun,WangJianfang.Total coloring of some graphs[J].Sci.ofChina,Se-riesA,1988,6:595-600
- [6] ChenDongling,WuJianliang.Total chromatic number ofCartesian product graph[J].Journal ofTaiyuanMechanismInstitute,1994,15(Suppl)
- [7] YapH P.Some topic of graph theory[M].Hefei:Press ofUniversity ofScience andTechnology ofChi-na,1992
- [8] ZhangZ F,WangJF.The prograss of total coloring graphs[J].Advances inMath,1992,21:390-397
- [9] ChenD L,WuJL.The total coloring of some graphs[A].Combinatorics,Graph theoryAlgorithmsandApplications[C].Beijing:WorldSci.Publishing,1994,17-20
- [10] YapH P.The total coloring of graphs[A].L ectureNotes inMathematics1623[C].Germany:Springer,1996
- [11] L iuErgen.The edge chromatic number of general graphK (5,n)[J].Journal ofEastChinaJiaotongUniversity,1997,14(2):85-87
- [12] L iuHongmei,ChenZeqian.The edge coloring classification of general graphK (4,n) and griozschgraphGn[J].Journal ofMath.,1996,16(2):531-53