Packing and covering triangles in planar graphs
DOI10.1007/S00373-010-0881-5zbMATH Open1205.05178OpenAlexW2036908020MaRDI QIDQ968221FDOQ968221
Will Ma, Qing Cui, Penny Haxell
Publication date: 5 May 2010
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-010-0881-5
Recommendations
- Packing and covering triangles in graphs
- Packing and covering triangles in tripartite graphs
- Packing triangles in a graph and its complement
- Packing and covering directed triangles
- Packing and covering triangles in \(K_{4}\)-free planar graphs
- Packing triangles in bounded degree graphs.
- Packing triangles in weighted 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
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
Cited In (16)
- Packings and perfect path double covers of maximal planar graphs
- Perfect Triangle Families
- Triangle packings and 1-factors in oriented graphs
- Packing and covering triangles in \(K_{4}\)-free planar graphs
- Covering triangles in edge-weighted 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
- On Tuza's conjecture for triangulations and graphs with small treewidth
- On Tuza's conjecture for triangulations and graphs with small treewidth
- On a conjecture of Tuza about packing and covering of triangles
- Small edge sets meeting all triangles of a graph
- Approximation algorithms on \(k\)-cycle transversal and \(k\)-clique transversal
- Number of triangular packings of a marked graph on a projective plane
- Packings and coverings of \(v=3m+1\) points with near-triangle factors
- Tuza's Conjecture for Threshold Graphs
This page was built for publication: Packing and covering triangles in planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968221)
