Transversals in regular uniform hypergraphs
From MaRDI portal
Publication:6144921
DOI10.1002/jgt.23051OpenAlexW4388420063MaRDI QIDQ6144921
Anders Yeo, Michael A. Henning
Publication date: 30 January 2024
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.23051
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimum size transversals in uniform hypergraphs
- Matchings and transversals in hypergraphs, domination and independence in trees
- Transversals and domination in uniform hypergraphs
- Transversals in 4-uniform hypergraphs
- Total domination of graphs and small transversals of hypergraphs
- Covering all cliques of a graph
- Small transversals in hypergraphs
- An upper bound for the transversal numbers of 4-uniform hypergraphs
- Transversal numbers of uniform hypergraphs
- Transversals in uniform hypergraphs with property \((p,2)\)
- Heavy transversals and indecomposable hypergraphs
- Small transversals in uniform hypergraphs
- Hypergraphs with large transversal number
- Transversals in linear uniform hypergraphs
- A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem
- Hypergraphs with large transversal number and with edge sizes at least 3
- Domination in partitioned graphs
- The Tuza–Vestergaard Theorem
This page was built for publication: Transversals in regular uniform hypergraphs