Vertex-disjoint copies of \(K_{1}+(K_{1} \cup K_{2}\)) in claw-free graphs

DOI10.1016/j.disc.2006.07.043zbMath1136.05057OpenAlexW1992225145MaRDI QIDQ2477386

Shinya Fujita

Publication date: 13 March 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.07.043

zbMATH Keywords

minimum degreeclaw-freevertex-disjoint

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (6)

Vertex disjoint copies of \(K_{1 , 4}\) in claw-free graphs ⋮ Vertex-disjoint \({K_1+(K_1\cup K_2)}\) in \(K_{1,4}\)-free graphs with minimum degree at least four ⋮ Vertex-disjoint copies of \(K_{1, t}\) in \(K_{1, r}\)-free graphs ⋮ Disjoint \(K_4^-\) in claw-free graphs with minimum degree at least five ⋮ Vertex-disjoint copies of \(K_{1,3}\) in \(K_{1,r}\)-free graphs ⋮ Vertex-disjoint stars in \(K_{1 , r}\)-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Vertex-disjoint triangles in claw-free graphs with minimum degree at least three
• Disjoint stars and forbidden subgraphs
• 1-Factors and Antifactor Sets

This page was built for publication: Vertex-disjoint copies of \(K_{1}+(K_{1} \cup K_{2}\)) in claw-free graphs