Upper transversals in hypergraphs
From MaRDI portal
Publication:2422208
DOI10.1016/j.ejc.2019.01.002zbMath1414.05295OpenAlexW2910726126MaRDI QIDQ2422208
Anders Yeo, Michael A. Henning
Publication date: 18 June 2019
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2019.01.002
Related Items (3)
Bounds on upper transversals in hypergraphs ⋮ Affine planes and transversals in 3-uniform linear hypergraphs ⋮ (In)approximability of maximum minimal FVS
Cites Work
- Minimum size transversals in uniform hypergraphs
- Total transversals and total domination in uniform hypergraphs
- Transversals and domination in uniform hypergraphs
- A global parallel algorithm for the hypergraph transversal problem
- Total domination of graphs and small transversals of hypergraphs
- Small transversals in hypergraphs
- On upper transversals in 3-uniform hypergraphs
- An upper bound for the transversal numbers of 4-uniform hypergraphs
- Transversal numbers of uniform hypergraphs
- Hypergraphs with large transversal number
- A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem
- Strong Transversals in Hypergraphs and Double Total Domination in Graphs
- Computing and Combinatorics
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Upper transversals in hypergraphs
