On Tuza's conjecture for triangulations and graphs with small treewidth
From MaRDI portal
Publication:5925498
DOI10.1016/j.disc.2020.112281zbMath1460.05188arXiv2002.07925OpenAlexW3123433281WikidataQ113877052 ScholiaQ113877052MaRDI QIDQ5925498
No author found.
Publication date: 25 March 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.07925
Related Items (1)
Cites Work
- Unnamed Item
- Packing and covering triangles in planar graphs
- A partial k-arboretum of graphs with bounded treewidth
- Packing and covering triangles in graphs
- Packing and covering triangles in tripartite graphs
- 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
- Tuza's conjecture for graphs with maximum average degree less than 7
- Sufficient Conditions for Tuza’s Conjecture on Packing and Covering Triangles
- Graph Theory
- Embeddings of graphs of fixed treewidth and bounded degree
- Tuza's Conjecture is Asymptotically Tight for Dense Graphs
This page was built for publication: On Tuza's conjecture for triangulations and graphs with small treewidth