Packing Triangles in Weighted Graphs
From MaRDI portal
Publication:4979838
DOI10.1137/100803869zbMath1293.05152arXiv1012.0372OpenAlexW2006160791MaRDI QIDQ4979838
Jessica McDonald, Diego Scheide, Bojan Mohar, Matt DeVos, Guillaume Chapuy
Publication date: 19 June 2014
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1012.0372
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Signed and weighted graphs (05C22)
Related Items (11)
Fractional \(K_{4}\)-covers ⋮ Packing and covering triangles in \(K_{4}\)-free planar graphs ⋮ Small edge sets meeting all triangles of a graph ⋮ Packing and covering directed triangles ⋮ Total Dual Integrality of Triangle Covering ⋮ Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture ⋮ Covering triangles in edge-weighted graphs ⋮ Sufficient Conditions for Tuza’s Conjecture on Packing and Covering Triangles ⋮ Packing and covering directed triangles asymptotically ⋮ Triangle packing and covering in dense random graphs ⋮ Tuza's conjecture for graphs with maximum average degree less than 7
This page was built for publication: Packing Triangles in Weighted Graphs
