Triangle packings and transversals of some K₄-free graphs

DOI10.1007/S00373-018-1903-YMaRDI QIDQ2413632zbMATH OpenOpenAlexFDO

Authors Andrea Munaro

Publication date 14 September 2018

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

Full work available at URL https://doi.org/10.1007/s00373-018-1903-y

zbMATH Keywords

triangle graphs\(\chi \)-boundedtriangle packing and transversal

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Transversal (matching) theory (05D15)

Recommendations

• On a conjecture of Tuza about packing and covering of triangles
• Packing and covering triangles in \(K_{4}\)-free planar graphs
• Packing triangles in \(K_4\)-free graphs
• On Tuza's conjecture for triangulations and graphs with small treewidth
• Packing and covering triangles in tripartite graphs

Cites work

• scientific article; zbMATH DE number 4085709 (Why is no real title available?)
• scientific article; zbMATH DE number 3232667 (Why is no real title available?)
• scientific article; zbMATH DE number 4183452 (Why is no real title available?)
• (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization.
• 11/30 (Finding large independent sets in connected triangle-free 3- regular graphs)
• A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
• A conjecture on triangles of graphs
• A stability theorem on fractional covering of triangles by edges
• An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
• Bounded clique cover of some sparse graphs
• Characterizations of derived graphs
• Complements of nearly perfect graphs
• Critical graphs with connected complements
• Gallai graphs and anti-Gallai graphs
• Generalized line graphs: Cartesian products and complexity of recognition
• Graph Theory and Probability
• Independence and matching number in graphs with maximum degree 4
• Independent sets and matchings in subcubic graphs
• Induced cycles in triangle graphs
• Induced subgraphs of graphs with large chromatic number. I. Odd holes
• Iterated k-line graphs
• Ki-covers. II.Ki-perfect graphs
• On a conjecture of Tuza about packing and covering of triangles
• On the hardness of recognizing triangular line graphs
• On the structure of (banner, odd hole)-free graphs
• On the tightness of the \(\frac {5}{14}\) independence ratio
• Packing and covering triangles in \(K_{4}\)-free planar graphs
• Packing and covering triangles in graphs
• Ryser's conjecture for tripartite 3-graphs
• Small edge sets meeting all triangles of a graph
• Some Ramsey-Type Numbers and the Independence Ratio
• The chromatic gap and its extremes
• The strong perfect graph theorem
• Transitiv orientierbare Graphen
• Tuza's conjecture for graphs with maximum average degree less than 7
• Two characterizations of interchange graphs of complete m-partite graphs
• \(K_ i\)-covers. I: Complexity and polytopes
• \(K_{4}\)-free graphs with no odd holes

Cited in

(6)

• Packing and covering triangles in \(K_{4}\)-free planar graphs
• On the number of edge-disjoint triangles in \(K_4\)-free graphs
• Triangle packing and covering in dense random graphs
• Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number
• Packing triangles in \(K_4\)-free graphs
• On Tuza's conjecture in dense graphs

This page was built for publication: Triangle packings and transversals of some \(K_{4}\)-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2413632)