Bounds on the game transversal number in hypergraphs
From MaRDI portal
Publication:326647
DOI10.1016/j.ejc.2016.07.003zbMath1348.05135arXiv1601.04856OpenAlexW2308662474WikidataQ59072340 ScholiaQ59072340MaRDI QIDQ326647
Michael A. Henning, Csilla Bujtás, Zsolt Tuza
Publication date: 12 October 2016
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1601.04856
Hypergraphs (05C65) Games involving graphs (91A43) Transversal (matching) theory (05D15) Games on graphs (graph-theoretic aspects) (05C57)
Related Items
Trees with equal total domination and game total domination numbers ⋮ On the game total domination number ⋮ Paired-Domination Game Played in Graphs ⋮ General upper bound on the game domination number ⋮ The matcher game played in graphs ⋮ A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals ⋮ Domination game and minimal edge cuts ⋮ Domination game on uniform hypergraphs ⋮ An Introduction to Game Domination in Graphs ⋮ Fractional domination game ⋮ Connected domination game played on Cartesian products
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The disjoint domination game
- Minimum size transversals in uniform hypergraphs
- Total transversals and total domination in uniform hypergraphs
- Hypergraphs with large transversal number and with edge sizes at least four
- Total version of the domination game
- On-line Ramsey theory for bounded degree graphs
- Transversals and domination in uniform hypergraphs
- Transversals and matchings in 3-uniform hypergraphs
- Game list colouring of graphs
- Covering all cliques of a graph
- Small transversals in hypergraphs
- A bound for the game chromatic number of graphs
- On-line Ramsey theory
- Hypergraphs with large transversal number
- Mr. Paint and Mrs. Correct
- On-line list colouring of graphs
- A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem
- Linear hypergraphs with large transversal number and maximum degree two
- Game matching number of graphs
- Transversal Game on Hypergraphs and the $\frac{3}{4}$-Conjecture on the Total Domination Game
- Domination Game and an Imagination Strategy
- Efficient Graph Packing via Game Colouring
- ON THE COMPLEXITY OF SOME COLORING GAMES
- Radius two trees specify χ‐bounded classes
- Toppling numbers of complete and random graphs
- Extremal Problems for Game Domination Number
