Tuza's Conjecture for Threshold Graphs
From MaRDI portal
Publication:6045403
DOI10.46298/dmtcs.7660zbMath1515.05141arXiv2105.09871OpenAlexW4292258317WikidataQ113691563 ScholiaQ113691563MaRDI QIDQ6045403
Tomáš Masařík, Karolina Okrasa, Jana Novotná, Łukasz Bożyk, Marthe Bonamy, Andrzej Grzesik, Meike Hatzel
Publication date: 30 May 2023
Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.09871
Cites Work
- Integer and fractional packings in dense graphs
- Packing and covering triangles in graphs
- On a conjecture of Tuza about packing and covering of triangles
- Small edge sets meeting all triangles of a graph
- \(\mathcal{U}\)-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited
- Tuza's conjecture for graphs with maximum average degree less than 7
- Graph Theory
- A new representation of proper interval graphs with an application to clique-width
- A tight Erdős-Pósa function for planar minors
- Multi-transversals for Triangles and the Tuza's Conjecture
- On Independent Circuits Contained in a Graph
- Tuza's Conjecture is Asymptotically Tight for Dense Graphs
- On Tuza's conjecture for triangulations and graphs with small treewidth
This page was built for publication: Tuza's Conjecture for Threshold Graphs
