On Tuza's conjecture for triangulations and graphs with small treewidth

DOI10.1016/j.entcs.2019.08.016OpenAlexW2978760409WikidataQ113317416 ScholiaQ113317416MaRDI QIDQ5918668

No author found.

Publication date: 27 April 2022

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.016

zbMATH Keywords

triangulationtreewidthtriangle packingtriangle transversal

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Graph theory (05Cxx)

Related Items (2)

Triangle packing and covering in dense random graphs ⋮ Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number

Cites Work

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