Packing and covering triangles in tripartite graphs
From MaRDI portal
Publication:1385295
DOI10.1007/s003730050010zbMath0895.05048OpenAlexW2049672706MaRDI QIDQ1385295
Penny E. Haxell, Yoshiharu Kohayakawa
Publication date: 6 September 1998
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s003730050010
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Transversal (matching) theory (05D15)
Related Items (17)
Induced cycles in triangle graphs ⋮ Recent techniques and results on the Erdős-Pósa property ⋮ 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 ⋮ A stability theorem on fractional covering of triangles by edges ⋮ 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 ⋮ Unnamed Item ⋮ Triangle packing and covering in dense random graphs ⋮ Packing and covering triangles in graphs ⋮ Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number
This page was built for publication: Packing and covering triangles in tripartite graphs
