Vertex-disjoint \({K_1+(K_1\cup K_2)}\) in \(K_{1,4}\)-free graphs with minimum degree at least four

DOI10.1007/s10114-014-2027-9zbMath1288.05135OpenAlexW2094576378MaRDI QIDQ2452412

Yun Shu Gao, Qingsong Zou

Publication date: 3 June 2014

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-014-2027-9

zbMATH Keywords

minimum degreevertex-disjoint subgraphsforbidden graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Vertex-disjoint copies of \(K_{1, t}\) in \(K_{1, r}\)-free graphs ⋮ Vertex-disjoint copies of \(K_{1,3}\) in \(K_{1,r}\)-free graphs

Cites Work

• Unnamed Item
• Vertex-disjoint triangles in \(K_{1,t}\)-free graphs with minimum degree at least \(t\)
• Vertex-disjoint triangles in claw-free graphs with minimum degree at least three
• Vertex-disjoint copies of \(K_{1}+(K_{1} \cup K_{2}\)) in claw-free graphs
• Disjoint stars and forbidden subgraphs

This page was built for publication: Vertex-disjoint \({K_1+(K_1\cup K_2)}\) in \(K_{1,4}\)-free graphs with minimum degree at least four