Vertex-disjoint copies of \(K_{1,3}\) in \(K_{1,r}\)-free graphs
From MaRDI portal
Publication:738867
DOI10.1016/j.disc.2016.06.015zbMath1343.05108OpenAlexW2504883631MaRDI QIDQ738867
Publication date: 16 August 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2016.06.015
Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (3)
Vertex disjoint copies of \(K_{1 , 4}\) in claw-free graphs ⋮ Vertex-disjoint copies of \(K_{1, t}\) 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 \(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 \({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}+(K_{1} \cup K_{2}\)) in claw-free graphs
- Disjoint stars and forbidden subgraphs
- 1-Factors and Antifactor Sets
This page was built for publication: Vertex-disjoint copies of \(K_{1,3}\) in \(K_{1,r}\)-free graphs