Total transversals and total domination in uniform hypergraphs
From MaRDI portal
Publication:405218
zbMath1300.05196arXiv1310.7359MaRDI QIDQ405218
Anders Yeo, Zsolt Tuza, Michael A. Henning, Csilla Bujtás
Publication date: 4 September 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.7359
Hypergraphs (05C65) Transversal (matching) theory (05D15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (15)
On upper transversals in 3-uniform hypergraphs ⋮ Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs ⋮ Bounds on the game transversal number in hypergraphs ⋮ The minimum number of vertices in uniform hypergraphs with given domination number ⋮ Upper transversals in hypergraphs ⋮ Noncover complexes, independence complexes, and domination numbers of hypergraphs ⋮ Domination game on uniform hypergraphs ⋮ Domination numbers and noncover complexes of hypergraphs ⋮ Lower bounds on Tuza constants for transversals in linear uniform hypergraphs ⋮ A note on fractional disjoint transversals in hypergraphs ⋮ Bounds on upper transversals in hypergraphs ⋮ Affine planes and transversals in 3-uniform linear hypergraphs ⋮ Domination and Total Domination in Hypergraphs ⋮ Transversal Game on Hypergraphs and the $\frac{3}{4}$-Conjecture on the Total Domination Game ⋮ Total Transversals in Hypergraphs and Their Applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- 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
- 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
- How many disjoint 2-edge paths must a cubic graph have?
- Total Domination in Graphs
This page was built for publication: Total transversals and total domination in uniform hypergraphs
