Disjoint \(K_4^-\) in claw-free graphs with minimum degree at least five

DOI10.1007/S11464-014-0434-YzbMath1307.05120OpenAlexW2088737358MaRDI QIDQ2258124

Yun Shu Gao, Qingsong Zou

Publication date: 2 March 2015

Published in: Frontiers of Mathematics in China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11464-014-0434-y

zbMATH Keywords

minimum degreeforbidden graphvertex-disjoint subgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• 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
• K₄⁻‐factor in a graph

This page was built for publication: Disjoint \(K_4^-\) in claw-free graphs with minimum degree at least five