期刊文献+

连通图中长圈交集的研究

Intersections of Long Cycles of Connected Graphs
在线阅读 下载PDF
导出
摘要 关于图中长圈交集的研究,ScottSmith提出了著名的Smith猜想,J.Chen等提出了一个更强的猜想.证明了当k=5时,J.Chen等提出的猜想成立,即证明对任意5-连通图G,C1和C2是G中任意2个圈,则G中一定存在2个圈C1*和C2*,满足V(C1*)∪V(C2)V(C1)∪V(C2)和V(C1*)∩V(C2*)≥5. On the intersections of long cycles,Scoot Smith proposed the well-known Smith conjecture,J.Chen et al.proposed a stronger conjecture.Verified the conjecture of J.Chen et al.for = 5.And proved:let is 5-connected,for any two cycles and in,there are two cycles and in satisfing V(C1*)∪V(C2)V(C1)∪V(C2) and V(C1*)∩V(C2*)≥5.
作者 吴亚平
出处 《江汉大学学报(自然科学版)》 2011年第3期32-35,共4页 Journal of Jianghan University:Natural Science Edition
关键词 连通度 区间 K-连通图 connectivity cycle interval -connected graph
  • 相关文献

参考文献10

  • 1Bondy J A. Basic graph theory: paths and circuits [M]// Graham R L, Grotschel M, Lovasz L. Handbook of Com- binatorics: Vol 1-2, Manuscript, 1995:3-110.
  • 2Chen J, Chen L, Liu D. Intersections of cycles in k-con- nected graphs[J]. Mannusript,2008.
  • 3Manoussakis Y. Longest cycles in 3-connected graphs with given independence number[J]. Graph Comb,2009,25:377- 384.
  • 4Chen G T, Hu Z Q, Wu Y E Circumferences of k-con- neded graphs involving independence numbers[J]. Journal of Graph Theory, 12 NOV 2010, DOI: 10.1002/jgt.20540.
  • 5West D B.图论导引:英文版[M].2版.北京:机械工业出版社,2004.
  • 6Grotschel M. Graph theory and combinatorics [M]. Lon- don: Academic Press, 1984.
  • 7Grotschel M, Nemhauser G L. A ploynomial algorithm for the max-cut problem on graphs without long odd cycles [J]. Math Programming, 1984,29:28-40.
  • 8Chen G T, Faudree R J, Gould R J. lntersectjions of longest cycles in kconnected graphs [J]. J Combin theory Ser B, 1998,72:143-149.
  • 9Dirac G A. Hamilton circuits and long circuits in finite graphs[J]. Ann Discrete Math,1978(3):143-149.
  • 10Menger k. Zur aUgemeinen kurventheorie[J]. Fund Math 1927,10:95-115.

共引文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部