Packing and covering triangles in K₄-free planar graphs
DOI10.1007/S00373-011-1071-9zbMATH Open1256.05188OpenAlexW2137429845MaRDI QIDQ1926019FDOQ1926019
Stéphan Thomassé, Alexandr Kostochka, Penny Haxell
Publication date: 27 December 2012
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-011-1071-9
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of packing and covering (05B40)
Cites Work
- Title not available (Why is that?)
- Packing and covering triangles in tripartite graphs
- On a conjecture of Tuza about packing and covering of triangles
- A conjecture on triangles of graphs
- Packing and covering triangles in graphs
- Some Ramsey-Type Numbers and the Independence Ratio
- A stability theorem on fractional covering of triangles by edges
- Packing Triangles in Weighted Graphs
- Packing and covering triangles in planar graphs
Cited In (18)
- Fractional \(K_{4}\)-covers
- Title not available (Why is that?)
- Packing and covering triangles in planar graphs
- Covering triangles in edge-weighted graphs
- Triangle packing and covering in dense random graphs
- Packing and covering directed triangles
- Title not available (Why is that?)
- Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number
- Sufficient Conditions for Tuza’s Conjecture on Packing and Covering Triangles
- On Tuza's conjecture for triangulations and graphs with small treewidth
- On Tuza's conjecture for triangulations and graphs with small treewidth
- Approximation algorithms on \(k\)-cycle transversal and \(k\)-clique transversal
- Triangle packings and transversals of some \(K_{4}\)-free graphs
- Packing and covering directed triangles asymptotically
- Tuza's conjecture for graphs with maximum average degree less than 7
- Recent techniques and results on the Erdős-Pósa property
- Total Dual Integrality of Triangle Covering
- Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture
Recommendations
- Title not available (Why is that?) 👍 👎
- On triangulating planar graphs under the four-connectivity constraint 👍 👎
- Packing and covering triangles in tripartite graphs 👍 👎
- Packing and covering triangles in graphs 👍 👎
- On triangulating planar graphs under the four-connectivity constraint 👍 👎
- Packing triangles in a graph and its complement 👍 👎
- Packing and covering triangles in planar graphs 👍 👎
- Packing triangles in \(K_4\)-free graphs 👍 👎
- Packing and covering immersions in 4-edge-connected graphs 👍 👎
- Triangle packings and transversals of some \(K_{4}\)-free graphs 👍 👎
This page was built for publication: Packing and covering triangles in \(K_{4}\)-free planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1926019)
