Packing triangles in K₄-free graphs
From MaRDI portal
Publication:2014715
Recommendations
Cites work
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- Flag algebras
- Graphs with small independence number minimizing the spectral radius
- Lower bounds on the number of triangles in a graph
- On a theorem of Rademacher-Turán
- On the Minimal Density of Triangles in Graphs
- On the number of complete subgraphs and circuits contained in graphs
- On the number of edge disjoint cliques in graphs of given size
- Some Theorems on Abstract Graphs
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)
