Vertex-disjoint triangles in claw-free graphs with minimum degree at least three
From MaRDI portal
Publication:1297765
DOI10.1007/PL00009833zbMATH Open0921.05040OpenAlexW2003462869MaRDI QIDQ1297765FDOQ1297765
Publication date: 14 September 1999
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009833
Recommendations
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (15)
- Guarding disjoint triangles and claws in the plane
- Triangle strings: structures for augmentation of vertex-disjoint triangle sets
- A nine vertex theorem for 3-connected claw- free graphs
- A twelve vertex theorem for 3-connected claw-free graphs
- 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
- Some results on Reed's conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \)
- Disjoint \(K_4^-\) in claw-free graphs with minimum degree at least five
- Minimum degree and disjoint cycles in claw-free graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Vertex-disjoint copies of \(K_{1, t}\) in \(K_{1, r}\)-free graphs
- 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
- Triangles in claw-free graphs
This page was built for publication: Vertex-disjoint triangles in claw-free graphs with minimum degree at least three
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1297765)
