Packing and covering triangles in tripartite graphs
From MaRDI portal
Publication:1385295
DOI10.1007/S003730050010zbMATH Open0895.05048OpenAlexW2049672706MaRDI QIDQ1385295FDOQ1385295
Penny 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)
Cited In (21)
- Fractional \(K_{4}\)-covers
- A stability theorem on fractional covering of triangles by edges
- Packing and covering triangles in planar graphs
- Packing and covering triangles in graphs
- Triangle packings and 1-factors in oriented graphs
- Packing and covering triangles in \(K_{4}\)-free planar graphs
- Covering triangles in edge-weighted graphs
- Induced cycles in triangle graphs
- Triangle packing and covering in dense random graphs
- Title not available (Why is that?)
- Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number
- Sufficient Conditions for Tuza’s Conjecture on Packing and Covering Triangles
- Title not available (Why is that?)
- On Tuza's conjecture for triangulations and graphs with small treewidth
- 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
- Approximation algorithms on \(k\)-cycle transversal and \(k\)-clique transversal
- Recent techniques and results on the Erdős-Pósa property
- Packings and coverings of \(v=3m+1\) points with near-triangle factors
- Packing and covering tetrahedra
This page was built for publication: Packing and covering triangles in tripartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1385295)
