Vertex-disjoint copies of K₁, t in K₁, r-free graphs
From MaRDI portal
Publication:507484
DOI10.1016/J.DISC.2016.11.034zbMATH Open1355.05199OpenAlexW2582479861MaRDI QIDQ507484FDOQ507484
Jin Yan, Shuya Chiba, Shinya Fujita, Su-yun Jiang
Publication date: 6 February 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2016.11.034
Extremal problems in graph theory (05C35) Vertex degrees (05C07) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Vertex-disjoint triangles in claw-free graphs with minimum degree at least three
- 1-Factors and Antifactor Sets
- 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
- Vertex-disjoint triangles in \(K_{1,t}\)-free graphs with minimum degree at least \(t\)
- Vertex-disjoint copies of \(K_{1,3}\) in \(K_{1,r}\)-free graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: Vertex-disjoint copies of \(K_{1, t}\) in \(K_{1, r}\)-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q507484)