Triangle packings and transversals of some \(K_{4}\)-free graphs
From MaRDI portal
Publication:2413632
DOI10.1007/s00373-018-1903-yzbMath1404.05140OpenAlexW2804069073MaRDI QIDQ2413632
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
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Transversal (matching) theory (05D15)
Related Items
Triangle packing and covering in dense random graphs ⋮ Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Induced cycles in triangle graphs
- Induced subgraphs of graphs with large chromatic number. I. Odd holes
- Complements of nearly perfect graphs
- A stability theorem on fractional covering of triangles by edges
- Independent sets and matchings in subcubic graphs
- On the hardness of recognizing triangular line graphs
- The chromatic gap and its extremes
- The strong perfect graph theorem
- Ryser's conjecture for tripartite 3-graphs
- Generalized line graphs: Cartesian products and complexity of recognition
- On the tightness of the \(\frac {5}{14}\) independence ratio
- \(K_{4}\)-free graphs with no odd holes
- \(K_ i\)-covers. I: Complexity and polytopes
- Gallai graphs and anti-Gallai graphs
- Packing and covering triangles in graphs
- Iterated \(k\)-line graphs
- Two characterizations of interchange graphs of complete m-partite graphs
- Critical graphs with connected complements
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization.
- On a conjecture of Tuza about packing and covering of triangles
- 11/30 (Finding large independent sets in connected triangle-free 3- regular graphs)
- Packing and covering triangles in \(K_{4}\)-free planar graphs
- Small edge sets meeting all triangles of a graph
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- A conjecture on triangles of graphs
- Tuza's conjecture for graphs with maximum average degree less than 7
- Bounded clique cover of some sparse graphs
- Independence and matching number in graphs with maximum degree 4
- Graph Theory and Probability
- Ki-covers. II.Ki-perfect graphs
- Some Ramsey-Type Numbers and the Independence Ratio
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- On the structure of (banner, odd hole)‐free graphs
- Transitiv orientierbare Graphen
- Characterizations of derived graphs
