Author:
Botler Fábio,Fernandes Cristina G.,Gutiérrez Juan
Abstract
Tuza (1981) conjectured that the size τ (G) of a minimum set of edges that meets 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 verify this conjecture for graphs with treewidth at most 6. In this paper, all graphs considered are simple and the notation and terminology are standard. A triangle transversal of a graph G is a set of edges of G whose deletion results in a triangle-free graph; and a triangle packing of G is a set of edge-disjoint triangles of G. We denote by τ (G) (resp. ν(G)) the size of a minimum triangle transversal (resp. triangle packing) of G. In [Tuza 1981] the following conjecture was posed: Conjecture (Tuza, 1981). For every graph G, we have τ (G) ≤ 2ν(G).
Publisher
Sociedade Brasileira de Computação - SBC
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献