Packing and covering directed triangles
From MaRDI portal
Recommendations
Cites work
- A conjecture on triangles of graphs
- Dense graphs with a large triangle cover have a large triangle packing
- Integer and fractional packings in dense graphs
- On a conjecture of Tuza about packing and covering of triangles
- Packing and covering triangles in \(K_{4}\)-free planar graphs
- Packing and covering triangles in graphs
- Packing triangles in weighted graphs
- Perfect Triangle Families
- Small edge sets meeting all triangles of a graph
- Tuza's conjecture for graphs with maximum average degree less than 7
- Tuza's conjecture is asymptotically tight for dense graphs
Cited in
(9)- Directed triangles in directed graphs
- Packing arc-disjoint cycles in oriented graphs
- Packing triangles in regular tournaments
- Packing and covering triangles in planar graphs
- Packing and Covering a Given Directed Graph in a Directed Graph
- Packing and covering triangles in graphs
- scientific article; zbMATH DE number 3861185 (Why is no real title available?)
- Packing and covering directed triangles asymptotically
- scientific article; zbMATH DE number 1275586 (Why is no real title available?)
This page was built for publication: Packing and covering directed triangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2191263)