Tuza's conjecture for graphs with maximum average degree less than 7
From MaRDI portal
Publication:2349964
DOI10.1016/j.ejc.2015.03.006zbMath1315.05115arXiv1308.2211OpenAlexW1989933315WikidataQ123358065 ScholiaQ123358065MaRDI QIDQ2349964
Publication date: 18 June 2015
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.2211
Related Items (12)
Induced cycles in triangle graphs ⋮ Fractional \(K_{4}\)-covers ⋮ Triangle packings and transversals of some \(K_{4}\)-free graphs ⋮ Tuza's Conjecture for Threshold Graphs ⋮ Packing and covering directed triangles ⋮ Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture ⋮ On Tuza's conjecture for triangulations and graphs with small treewidth ⋮ On Tuza's conjecture for triangulations and graphs with small treewidth ⋮ Packing and covering directed triangles asymptotically ⋮ Unnamed Item ⋮ Triangle packing and covering in dense random graphs ⋮ Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A stability theorem on fractional covering of triangles by edges
- König-Egerváry graphs are non-Edmonds
- Integer and fractional packings in dense graphs
- Independence numbers of graphs - an extension of the Koenig-Egervary theorem
- Packing and covering triangles in graphs
- \(3n-5\) edges do force a subdivision of \(K_5\)
- On a conjecture of Tuza about packing and covering of triangles
- Packing and covering triangles in \(K_{4}\)-free planar graphs
- Small edge sets meeting all triangles of a graph
- A conjecture on triangles of graphs
- Über eine Eigenschaft der ebenen Komplexe
- Dense Graphs With a Large Triangle Cover Have a Large Triangle Packing
- A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles
- Packing Triangles in Weighted Graphs
This page was built for publication: Tuza's conjecture for graphs with maximum average degree less than 7
