科研之友
微信
新浪微博
Facebook
分享链接
摘要
A graph is said to be claw-free if it does not contain an induced subgraph isomorphic to K (1,3). Let K (4) (-) be the graph obtained by removing exactly one edge from K (4) and let k be an integer with k a (c) 3/4 2. We prove that if G is a claw-free graph of order at least 13k - 12 and with minimum degree at least five, then G contains k vertex-disjoint copies of K (4) (-) . The requirement of number five is necessary.
