Total Transversals in Hypergraphs and Their Applications
From MaRDI portal
Publication:5251541
DOI10.1137/140951722zbMath1311.05138OpenAlexW2098137855MaRDI QIDQ5251541
Michael A. Henning, Anders Yeo
Publication date: 20 May 2015
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/140951722
Hypergraphs (05C65) Transversal (matching) theory (05D15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Total transversals and total domination in uniform hypergraphs
- Hypergraphs with large transversal number and with edge sizes at least four
- Hypergraphs with large domination number and with edge sizes at least three
- Transversals and domination in uniform hypergraphs
- Transversals and matchings in 3-uniform hypergraphs
- Total domination of graphs and small transversals of hypergraphs
- A survey of selected recent results on total domination in graphs
- Small transversals in hypergraphs
- An upper bound for the transversal numbers of 4-uniform hypergraphs
- Transversal numbers of uniform hypergraphs
- Linear hypergraphs with large transversal number and maximum degree two
- Domination in hypergraphs
- Strong Transversals in Hypergraphs and Double Total Domination in Graphs
- Hypergraphs with large transversal number and with edge sizes at least 3
- Total domination in 2-connected graphs and in graphs with no induced 6-cycles
- Hypergraph domination and strong independence
- Total domination in graphs
- Total Domination in Graphs
This page was built for publication: Total Transversals in Hypergraphs and Their Applications