Vertex-disjoint triangles in claw-free graphs with minimum degree at least three
From MaRDI portal
Publication:1297765
DOI10.1007/PL00009833zbMath0921.05040OpenAlexW2003462869MaRDI QIDQ1297765
Publication date: 14 September 1999
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009833
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (9)
Minimum Degree and Disjoint Cycles in Claw-Free Graphs ⋮ Triangle strings: structures for augmentation of vertex-disjoint triangle 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, t}\) in \(K_{1, r}\)-free graphs ⋮ Vertex-disjoint copies of \(K_{1}+(K_{1} \cup K_{2}\)) in claw-free graphs ⋮ Disjoint \(K_4^-\) in claw-free graphs with minimum degree at least five ⋮ Some results on Reed's conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \) ⋮ 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
This page was built for publication: Vertex-disjoint triangles in claw-free graphs with minimum degree at least three