期刊文献+

A Property of Claw-free Graphs

A Property of Claw-free Graphs
下载PDF
导出
摘要 In this paper we consider a property of claw-free graphs.We show that if d(u)+ d(v)≥ν(G)+2k+3,for every two nonadjacent vertices u and v,then G is 2k-vertex-deletable IM-extendable,whereν(G)=|V(G)|.And the bound is tight. In this paper we consider a property of claw-free graphs.We show that if d(u)+ d(v)≥ν(G)+2k+3,for every two nonadjacent vertices u and v,then G is 2k-vertex-deletable IM-extendable,whereν(G)=|V(G)|.And the bound is tight.
出处 《Chinese Quarterly Journal of Mathematics》 CSCD 2011年第3期445-447,共3页 数学季刊(英文版)
基金 Supported by the National Natural Sciences Youth Foundation(10901144)
关键词 IM-extendable vertex-deletable IM-extendable claw-free graph IM-extendable vertex-deletable IM-extendable claw-free graph
  • 相关文献

参考文献3

二级参考文献10

  • 1Yang F,Advances in Operations Research and Systems Engineering,1998年,142页
  • 2Yuan J J,J Graph Theory,1998年,28卷,203页
  • 3Yuan J J,J Graph Theory,1998年,28期,203页
  • 4Lovasz,L.and Plummer,M.D.,Matching Theory,Elsevier SciencePublishers,B.V.North Holland,1985.
  • 5Cameron,K.,Induced matchings,Discrete Appl.Math.,1989,24:97~102.
  • 6Faudree,R.T.,Gyarfas,A.,Schelp,R.M.,et al.,Induced matchings in bipartitegraphs,Disrete Math.,1989,78:83~87.
  • 7Horak,P.,Qing, H.,Trotter,W.T.,Induced matchings in cubic graphs,J.GraphTheory,1993,17:151~160.
  • 8Yuan,J.J.,The induced matching extendable graphs,J.Graph Theory,1998,28:203~213.
  • 9Tutte,W.T.,The factorization of linear graphs,J.London Math.Soc.,1947,22:107~111.
  • 10Bondy,J.A.,Murty,U.S.R.,Graph Theory with Applications,Macmillan PressLtd.,London,1976.

共引文献18

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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