Packing and covering triangles in graphs
From MaRDI portal
Recommendations
- Packing and covering triangles in tripartite graphs
- Packing triangles in a graph and its complement
- Packing and covering directed triangles
- Packing triangles in weighted graphs
- Packing triangles in bounded degree graphs.
- Triangle packing and covering in dense random graphs
- Packing and covering triangles in dense random graphs
- Packing triangles in low degree graphs and indifference graphs
- Packing triangles in low degree graphs and indifference graphs
Cites work
Cited in
(42)- Fractional \(K_{4}\)-covers
- Improved bounds on a generalization of Tuza's conjecture
- A stability theorem on fractional covering of triangles by edges
- Packing and covering triangles in planar graphs
- Packing and Covering a Given Directed Graph in a Directed Graph
- Generalized Tuza's conjecture for random hypergraphs
- Triangle packings and 1-factors in oriented graphs
- Perfect Triangle Families
- Packing and covering triangles in \(K_{4}\)-free planar graphs
- Covering triangles in edge-weighted graphs
- Triangle packing and covering in dense random graphs
- scientific article; zbMATH DE number 706830 (Why is no real title available?)
- scientific article; zbMATH DE number 1760745 (Why is no real title available?)
- Packing and covering directed triangles
- Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number
- Sufficient conditions for Tuza's conjecture on packing and covering triangles
- Tuza's conjecture is asymptotically tight for dense graphs
- Brambles and independent packings in chordal graphs
- Tuza's conjecture for random graphs
- Covering the edges of a graph with triangles
- On Tuza's conjecture for triangulations and graphs with small treewidth
- Total dual integrality of triangle covering
- On Tuza's conjecture for triangulations and graphs with small treewidth
- Packing and covering triangles in bilaterally-complete tripartite graphs
- Small edge sets meeting all triangles of a graph
- Dense graphs with a large triangle cover have a large triangle packing
- Approximation algorithms on \(k\)-cycle transversal and \(k\)-clique transversal
- Triangle packings and transversals of some \(K_{4}\)-free graphs
- Packing and covering directed triangles asymptotically
- Tuza's conjecture for graphs with maximum average degree less than 7
- The minimum number of triangles covering the edges of a graph
- A Turán-type generalization of Tuza's triangle edge cover problem
- Easily testable graph properties
- Recent techniques and results on the Erdős-Pósa property
- Large triangle packings and Tuza's conjecture in sparse random graphs
- The geometry and combinatorics of discrete line segment hypergraphs
- Packing and covering tetrahedra
- Closing the random graph gap in Tuza's conjecture through the online triangle packing process
- Packings and coverings of \(v=3m+1\) points with near-triangle factors
- scientific article; zbMATH DE number 1275586 (Why is no real title available?)
- Tuza's Conjecture for Threshold Graphs
- Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture
This page was built for publication: Packing and covering triangles in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296990)
