Covering triangles in edge-weighted graphs
DOI10.1007/S00224-018-9860-7zbMATH Open1396.05090OpenAlexW2793477091WikidataQ130062059 ScholiaQ130062059MaRDI QIDQ726109FDOQ726109
Zhuo Diao, Xujin Chen, Zhongzheng Tang, Xiaodong 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
Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- The probabilistic method
- Packing and covering triangles in tripartite graphs
- On a conjecture of Tuza about packing and covering of triangles
- A conjecture on triangles of graphs
- Packing and covering triangles in graphs
- Packing and covering triangles in \(K_{4}\)-free planar graphs
- Packing Triangles in Weighted Graphs
- On a Class of Totally Unimodular Matrices
- Packing and covering triangles in planar graphs
- Sufficient Conditions for Tuza’s Conjecture on Packing and Covering Triangles
- Tuza's Conjecture is Asymptotically Tight for Dense Graphs
Cited In (9)
- A sharp upper bound for the transversal number of \(k\)-uniform connected hypergraphs with given size
- Title not available (Why is that?)
- On the transversal number of \(k\)-uniform connected hypergraphs
- Triangle packing and covering in dense random graphs
- Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number
- On the feedback number of 3-uniform linear extremal hypergraphs
- Finding optimal triangulations parameterized by edge clique cover
- On the transversal number of rank \(k\) hypergraphs
- Approximation algorithms on \(k\)-cycle transversal and \(k\)-clique transversal
This page was built for publication: Covering triangles in edge-weighted graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q726109)
