On Tuza's Conjecture in Co-Chain Graphs
On Tuza's Conjecture in Co-Chain Graphs
In 1981, Tuza conjectured that the cardinality of a minimum set of edges that intersects every triangle of agraph is at most twice the cardinality of a maximum set of edge-disjoint triangles. This conjecture have beenproved for several important graph classes, as planar graphs, tripartite graphs, among others. However, itremains …