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

02/18/2020
by   Fábio Botler, et al.
0

Tuza (1981) conjectured that the size τ(G) of a minimum set of edges that intersects every triangle of a graph G is at most twice the size ν(G) of a maximum set of edge-disjoint triangles of G. In this paper we present three results regarding Tuza's Conjecture. We verify it for graphs with treewidth at most 6; we show that τ(G)≤3/2 ν(G) for every planar triangulation G different from K_4; and that τ(G)≤9/5 ν(G) + 1/5 if G is a maximal graph with treewidth 3.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/20/2021

Tuza's Conjecture for Threshold Graphs

Tuza famously conjectured in 1981 that in a graph without k+1 edge-disjo...
research
03/19/2018

Gallai's path decomposition conjecture for triangle-free planar graphs

A path decomposition of a graph G is a collection of edge-disjoint paths...
research
09/06/2019

An Effective Upperbound on Treewidth Using Partial Fill-in of Separators

Partitioning a graph using graph separators, and particularly clique sep...
research
05/01/2020

On the treewidth of Hanoi graphs

The objective of the well-known Towers of Hanoi puzzle is to move a set ...
research
03/23/2023

Clustered independence and bounded treewidth

A set S⊆ V of vertices of a graph G is a c-clustered set if it induces a...
research
04/10/2023

Odd-Minors I: Excluding small parity breaks

Given an annotated graph class 𝒞, the 𝒞-blind-treewidth of a graph G is ...
research
02/15/2022

The treewidth and pathwidth of graph unions

For two graphs G_1 and G_2 on the same vertex set [n]:={1,2, …, n}, and ...

Please sign up or login with your details

Forgot password? Click here to reset