Packing and covering triangles in graphs
From MaRDI portal
Publication:1296990
DOI10.1016/S0012-365X(98)00183-6zbMath0930.05077MaRDI QIDQ1296990
Publication date: 9 February 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (31)
Dense Graphs With a Large Triangle Cover Have a Large Triangle Packing ⋮ Recent techniques and results on the Erdős-Pósa property ⋮ The geometry and combinatorics of discrete line segment hypergraphs ⋮ Fractional \(K_{4}\)-covers ⋮ Packing and covering tetrahedra ⋮ Packing and covering triangles in \(K_{4}\)-free planar graphs ⋮ Small edge sets meeting all triangles of a graph ⋮ Triangle packings and transversals of some \(K_{4}\)-free graphs ⋮ Tuza's Conjecture for Threshold Graphs ⋮ Tuza's conjecture for random graphs ⋮ Packing and covering directed triangles ⋮ A stability theorem on fractional covering of triangles by edges ⋮ Total Dual Integrality of Triangle Covering ⋮ Packing and Covering a Given Directed Graph in a Directed Graph ⋮ Easily Testable Graph Properties ⋮ Tuza's Conjecture is Asymptotically Tight for Dense Graphs ⋮ Closing the Random Graph Gap in Tuza's Conjecture through the Online Triangle Packing Process ⋮ Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture ⋮ Packing and covering triangles in planar graphs ⋮ Covering triangles in edge-weighted graphs ⋮ On Tuza's conjecture for triangulations and graphs with small treewidth ⋮ On Tuza's conjecture for triangulations and graphs with small treewidth ⋮ Sufficient Conditions for Tuza’s Conjecture on Packing and Covering Triangles ⋮ Approximation algorithms on \(k\)-cycle transversal and \(k\)-clique transversal ⋮ Packing and covering directed triangles asymptotically ⋮ Large triangle packings and Tuza’s conjecture in sparse random graphs ⋮ Unnamed Item ⋮ Triangle packing and covering in dense random graphs ⋮ Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number ⋮ Improved bounds on a generalization of Tuza's conjecture ⋮ Tuza's conjecture for graphs with maximum average degree less than 7
Cites Work
This page was built for publication: Packing and covering triangles in graphs
