Covering triangles in edge-weighted graphs

DOI10.1007/s00224-018-9860-7zbMath1396.05090OpenAlexW2793477091MaRDI QIDQ726109

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

Publication date: 3 August 2018

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-018-9860-7

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) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

Related Items

On the feedback number of 3-uniform linear extremal hypergraphs, On the transversal number of rank \(k\) hypergraphs, On the transversal number of \(k\)-uniform connected hypergraphs, 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, A sharp upper bound for the transversal number of \(k\)-uniform connected hypergraphs with given size

Cites Work

• Unnamed Item
• Unnamed Item
• 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