Sufficient Conditions for Tuza’s Conjecture on Packing and Covering Triangles

DOI10.1007/978-3-319-44543-4_21zbMath1391.05203arXiv1605.01816OpenAlexW2964006232MaRDI QIDQ2819510

Zhuo Diao, Zhongzheng Tang, Xiao-Dong Hu, Xu-jin Chen

Publication date: 29 September 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.01816

zbMATH Keywords

combinatorial algorithmstriangle packinglinear 3-uniform hypergraphstriangle cover

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (8)

On the feedback number of 3-uniform linear extremal hypergraphs ⋮ 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 ⋮ Triangle packing and covering in dense random graphs ⋮ Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number

Cites Work

• Unnamed Item
• Packing and covering triangles in planar graphs
• Packing and covering triangles in graphs
• Packing and covering triangles in tripartite graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• On a conjecture of Tuza about packing and covering of triangles
• Packing and covering triangles in \(K_{4}\)-free planar graphs
• A conjecture on triangles of graphs
• Sufficient Conditions for Tuza’s Conjecture on Packing and Covering Triangles
• On a Class of Totally Unimodular Matrices
• Packing Triangles in Weighted Graphs
• Tuza's Conjecture is Asymptotically Tight for Dense Graphs

This page was built for publication: Sufficient Conditions for Tuza’s Conjecture on Packing and Covering Triangles