Packing and covering triangles in planar graphs

DOI10.1007/s00373-010-0881-5zbMath1205.05178OpenAlexW2036908020MaRDI QIDQ968221

Will Ma, Qing Cui, Penny E. 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

zbMATH Keywords

planar graphpacking and covering

Mathematics Subject Classification ID

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)

Related Items (8)

Packing and covering triangles in \(K_{4}\)-free planar graphs ⋮ Small edge sets meeting all triangles of a graph ⋮ 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 ⋮ Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number

Cites Work

• Packing and covering triangles in graphs
• Packing and covering triangles in tripartite graphs
• On a conjecture of Tuza about packing and covering of triangles
• A conjecture on triangles of graphs

This page was built for publication: Packing and covering triangles in planar graphs