Disjoint \(K_4^-\) in claw-free graphs with minimum degree at least five
From MaRDI portal
Publication:2258124
DOI10.1007/s11464-014-0434-yzbMath1307.05120MaRDI QIDQ2258124
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
05C35: Extremal problems in graph theory
05C07: Vertex degrees
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
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
- K4−‐factor in a graph