期刊文献+

不含某些子图的k连通图中的k可收缩边

k-CONTRACTIBLE EDGES IN k-CONNECTED GRAPHS NOT CONTAINING SOME SPECIFIED GRAPHS
原文传递
导出
摘要 最近Ando等证明了在一个k(k≥5是一个整数)连通图G中,如果δ(G)≥k+1,并且G中既不含K_5^-,也不含5K_1+P_3,则G中含有一条k可收缩边.对此进行了推广,证明了在一个k连通图G中,如果δ(G)≥k+1,并且G中既不含K_2+([k-1/2]K_1∪P_3),也不含tK_1+P_3(k,t都是整数,且t≥3),则当k≥4t-7时,G中含有一条k可收缩边. Recently,Ando et al.proved that in a k-(k≥5 is an integer) connected graph G,ifδ(G)≥k + 1,and G contains neither K_5^-,nor 5K_1 + P_3,then G has a k contractible edge.In this paper,the result is generalized,and it is proved that in a k- conneted graph G, ifδ(G)≥k + 1,and G contains neither K_2 +([(k-1)/2]K_1∪P_3),nor tK_1 + P_3(both k and t are integers,and t≥3) and if k≥4t- 7,then G has a fc contractible edge.
出处 《系统科学与数学》 CSCD 北大核心 2010年第7期922-928,共7页 Journal of Systems Science and Mathematical Sciences
关键词 断片 可收缩边 k连通图 Fragments contractible edge k connected graph.
  • 相关文献

参考文献7

  • 1Bondy J A,Murty U S R.Graph Theory with Applications.London:MacMillan,1976.
  • 2Thomassen C.Non-separating cycles in k-connected graphs.J.Graph Theory,1981,5:351-354.
  • 3Kawarabayashi K.Note on k contractible edges in k connected graphs.Australasian J.Combin.,2001,24:165-168.
  • 4Ando K,Kaneko A,Kawarabayashi K,Yoshiomoto K.Contractible edges and bowties in a k-connected graph.Ars.Combin.,2002,64:239-247.
  • 5Egawa Y.Contractible edges in n-connected graphs with minimum degree greater than or equal to[5n/4].Graphs and Combin.,1991,7:15-21.
  • 6Ando K,Kawarabayashi K.Some forbidden subgraph conditions for a graph to have a k-contractible edge.Discrete Math.,2003,267:3-11.
  • 7Ando K,Kaneko A,Kawarabaynshi K.Contractible edges in minimally k connected graphs.Discrete Math.,2008,308:597-602.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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