浏览全部资源
扫码关注微信
1. 中国人民解放军信息工程大学电子技术学院
2. 微联国际软件公司
3. 北京大学数学科学学院
Published:2008
移动端阅览
徐述, 欧阳剑新, 石胜坤. The Connectivity of k-Chromatic Graphs[J]. 2008, (2): 101-104.
DOI:
徐述, 欧阳剑新, 石胜坤. The Connectivity of k-Chromatic Graphs[J]. 2008, (2): 101-104. DOI:
研究和讨论了图的顶点着色问题中k色图的连通性
利用归纳与迭代的方法证明了对于任何k色连通图G
存在顶点V(G)的一个着色X1
X2
…
Xk
使得对该着色类中任意顶点集Xi所诱导出的Gk的子图Gk(Xi)都是连通的.从而证明了Chen
Schelp和Shreve关于k色图的连通性的一个推测.最后将所得的结论作了进一步推广.
The connectivity of k-chromatic graphs were discussed.By induction and iteration
it was proved that for any connected k-chromatic graph G
there exists a k coloring X1
Xk of V(G) such that Gk(Xi) is connected for each i.Thus the conjecture of Chen
Schelp and Shreve was verified.Finally the conclusion was further generalized.
Nelson R,Wilson R J.Graph Colourings[M].London:Pitman Research Notes in Mathematic Series,1990.
Jensen T R,Toft B.Graph Coloring Problems[M].New York:Wiley-Interscience,1995.
Bondy J A,Murty U S R.Graph Theory with Applications[M].London:Macmillan,1976.
Chen G T,Schelp R H,Shreve W E.A special k-coloring for a connected k-chromatic graph[J].Discrete Mathe-matics,1997,170(1-3):231-236.
Szigeti J,Tuza Z.Generalized colorings and avoidable orientations[J].Discuss.Math.Graph Theory,1997,17:137-145.
Kawarabayashi K I,Lee O,Yu X X.Non-separating paths in 4-connected graphs[J].Annals of Combinatorics,2005,9(1):47-56.
Kawarabayashi K,Luo R,Niu J B,et al.On the structure of k-connected graphs without K-k-minor[J].EuropeanJournal of Combinatorics,2005,26(3-4):293-308.
Huang X L,Jin Z M,Yu X X,et al.Contractible cliques in k-connected graphs[J].Graphs and Combinatorics,2006,22(3):361-370.
0
Views
76
下载量
CSCD
Publicity Resources
Related Articles
Related Author
Related Institution