Extensions and applications of the Tuza-Vestergaard theorem
From MaRDI portal
Cites work
- A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem
- A new upper bound on the total domination number in graphs with minimum degree six
- An upper bound for the transversal numbers of 4-uniform hypergraphs
- Covering all cliques of a graph
- Domination in partitioned graphs
- Heavy transversals and indecomposable hypergraphs
- scientific article; zbMATH DE number 5808 (Why is no real title available?)
- scientific article; zbMATH DE number 861353 (Why is no real title available?)
- Hypergraphs with large transversal number
- Hypergraphs with large transversal number and with edge sizes at least 3
- Independence in 5-uniform hypergraphs
- Matchings and transversals in hypergraphs, domination and independence in trees
- Minimum size transversals in uniform hypergraphs
- Small transversals in hypergraphs
- Small transversals in uniform hypergraphs
- The Tuza–Vestergaard Theorem
- Total domination of graphs and small transversals of hypergraphs
- Transversal numbers of uniform hypergraphs
- Transversals and domination in uniform hypergraphs
- Transversals in 4-uniform hypergraphs
- Transversals in 6-uniform hypergraphs and total domination in graphs with minimum degree six
- Transversals in linear uniform hypergraphs
- Transversals in regular uniform hypergraphs
- Transversals in uniform hypergraphs with property \((p,2)\)
This page was built for publication: Extensions and applications of the Tuza-Vestergaard theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6930163)
