Vertex-disjoint copies of K₁+(K₁K₂) in claw-free graphs

详细信息	查看全文 | 推荐本文 |

• 作者：Shinya Fujita
• 关键词：Claw-free ; Minimum degree ; Vertex-disjoint
• 刊名：Discrete Mathematics
• 出版年：2008
• 期刊代码：47_0012365x
• 类别：cp
• 出版时间：6 May 2008
• 卷：308
• 期：9
• 页码：1628-1633
• 文件大小：153 K

摘要

A graph G is said to be claw-free if G does not contain an induced subgraph isomorphic to 10&_cdi=5632&_rdoc=13&_acct=C000050221&_version=1&_userid=10&md5=1692ae61b8df55f2a1e448d14af0a081" title="Click to view the MathML source">K_1,3. Let k be an integer with 10&_cdi=5632&_rdoc=13&_acct=C000050221&_version=1&_userid=10&md5=15b014656ea21b809d4a83f9e9289b64" title="Click to view the MathML source">k2. We prove that if G is a claw-free graph of order at least 10&_cdi=5632&_rdoc=13&_acct=C000050221&_version=1&_userid=10&md5=5acf5a8be4c5837b58efb3781109ec51" title="Click to view the MathML source">7k-6 and with minimum degree at least 3, then G contains k vertex-disjoint copies of 10&_cdi=5632&_rdoc=13&_acct=C000050221&_version=1&_userid=10&md5=0d471072b1dcab64b967a75a3b370d04" title="Click to view the MathML source">K₁+(K₁K₂).