Packing triangles in K₄-free graphs
From MaRDI portal
Publication:2014715
DOI10.1007/S00373-013-1300-5zbMATH Open1291.05099OpenAlexW2092251631MaRDI QIDQ2014715FDOQ2014715
Authors: S. C. Huang, Lingsheng Shi 
Publication date: 16 June 2014
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-013-1300-5
Recommendations
Cites Work
- Flag algebras
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some Theorems on Abstract Graphs
- Lower bounds on the number of triangles in a graph
- On the Minimal Density of Triangles in Graphs
- On the number of complete subgraphs and circuits contained in graphs
- On a theorem of Rademacher-Turán
- On the number of edge disjoint cliques in graphs of given size
- Graphs with small independence number minimizing the spectral radius
Cited In (12)
- Sparse halves in triangle-free graphs
- Triangle packings and 1-factors in oriented graphs
- A \((3+\epsilon)k\)-vertex kernel for edge-disjoint triangle packing
- Packing and covering triangles in \(K_{4}\)-free planar graphs
- On the number of edge-disjoint triangles in \(K_4\)-free graphs
- On the number of edge-disjoint triangles in \(K_4\)-free graphs
- Many disjoint triangles in co-triangle-free graphs
- Packing triangles in a graph and its complement
- On the number of \(K_4\)-saturating edges
- Triangle packings and transversals of some \(K_{4}\)-free graphs
- Packing Cliques in Graphs with Independence Number 2
- Large triangle-free subgraphs in graphs without \(K_ 4\)
This page was built for publication: Packing triangles in \(K_4\)-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014715)
