Triangle packings and transversals of some K₄-free graphs

DOI10.1007/S00373-018-1903-YzbMATH Open1404.05140OpenAlexW2804069073MaRDI QIDQ2413632FDOQ2413632

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

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

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)

Cites Work

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

Cited In (3)

• Packing and covering triangles in \(K_{4}\)-free planar graphs
• Triangle packing and covering in dense random graphs
• Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number

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)