A conjecture on triangles of graphs

DOI10.1007/BF01787705zbMath0724.05059WikidataQ122927113 ScholiaQ122927113MaRDI QIDQ2276982

Zsolt Tuza

Publication date: 1990

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

planar graphsdigraphschordal graphstrianglestransversal number3-uniform hypergraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (30)

Induced cycles in triangle graphs ⋮ On a conjecture of Tuza about packing and covering of triangles ⋮ A semidefinite approach to the $K_i$-cover problem ⋮ Recent techniques and results on the Erdős-Pósa property ⋮ The geometry and combinatorics of discrete line segment hypergraphs ⋮ Fractional \(K_{4}\)-covers ⋮ Packing and covering tetrahedra ⋮ Packing and covering triangles in \(K_{4}\)-free planar graphs ⋮ Small edge sets meeting all triangles of a graph ⋮ Triangle packings and transversals of some \(K_{4}\)-free graphs ⋮ Packing and covering directed triangles ⋮ A stability theorem on fractional covering of triangles by edges ⋮ Total Dual Integrality of Triangle Covering ⋮ Packing and Covering a Given Directed Graph in a Directed Graph ⋮ Edge-disjoint odd cycles in planar graphs. ⋮ Graph edge coloring: a survey ⋮ Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture ⋮ Packing and covering triangles in planar graphs ⋮ Covering triangles in edge-weighted graphs ⋮ On Tuza's conjecture for triangulations and graphs with small treewidth ⋮ On Tuza's conjecture for triangulations and graphs with small treewidth ⋮ Sufficient Conditions for Tuza’s Conjecture on Packing and Covering Triangles ⋮ Approximation algorithms on \(k\)-cycle transversal and \(k\)-clique transversal ⋮ Packing and covering directed triangles asymptotically ⋮ Unnamed Item ⋮ Triangle packing and covering in dense random graphs ⋮ Packing and covering triangles in graphs ⋮ Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number ⋮ Improved bounds on a generalization of Tuza's conjecture ⋮ Tuza's conjecture for graphs with maximum average degree less than 7

Cites Work

• On rigid circuit graphs
• Helly-type hypergraphs and Sperner families
• Upper bound for transversals of tripartite hypergraphs
• Triangle-free partial graphs and edge covering theorems
• Unnamed Item
• Unnamed Item

This page was built for publication: A conjecture on triangles of graphs