Packing triangles in \(K_4\)-free graphs
From MaRDI portal
Publication:2014715
DOI10.1007/s00373-013-1300-5zbMath1291.05099OpenAlexW2092251631MaRDI QIDQ2014715
Shunchang Huang, Ling-Sheng 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
Related Items
On the number of edge-disjoint triangles in \(K_4\)-free graphs ⋮ On the number of edge-disjoint triangles in \(K_4\)-free graphs
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- On the Minimal Density of Triangles in Graphs
- Lower bounds on the number of triangles in a graph
- Flag algebras
- On the number of complete subgraphs and circuits contained in graphs
- Some Theorems on Abstract Graphs
