Transversal Game on Hypergraphs and the $\frac{3}{4}$-Conjecture on the Total Domination Game
From MaRDI portal
Publication:2821619
DOI10.1137/15M1049361zbMath1345.05061WikidataQ59072433 ScholiaQ59072433MaRDI QIDQ2821619
Michael A. Henning, Csilla Bujtás, Zsolt Tuza
Publication date: 22 September 2016
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Hypergraphs (05C65) Games involving graphs (91A43) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (28)
Trees with equal total domination and game total domination numbers ⋮ The game total domination problem is log-complete in PSPACE ⋮ On the game total domination number ⋮ Bounds on the game transversal number in hypergraphs ⋮ Paired-Domination Game Played in Graphs ⋮ Perfect graphs for domination games ⋮ Maker-breaker total domination game ⋮ General upper bound on the game domination number ⋮ Z-domination game ⋮ Bounds for the competition-independence game on trees ⋮ Fast winning strategies for staller in the maker-breaker domination game ⋮ The matcher game played in graphs ⋮ A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals ⋮ Infinite families of circular and Möbius ladders that are total domination game critical ⋮ Unnamed Item ⋮ THE DOMINATION GAME ON SPLIT GRAPHS ⋮ Domination game and minimal edge cuts ⋮ Effect of predomination and vertex removal on the game total domination number of a graph ⋮ Domination game on uniform hypergraphs ⋮ The variety of domination games ⋮ A note on fractional disjoint transversals in hypergraphs ⋮ Game total domination critical graphs ⋮ An Introduction to Game Domination in Graphs ⋮ Game total domination for cyclic bipartite graphs ⋮ \( 1 / 2\)-conjectures on the domination game and claw-free graphs ⋮ Fractional domination game ⋮ Connected domination game: Predomination, Staller-start game, and lexicographic products ⋮ Connected domination game played on Cartesian products
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The disjoint domination game
- Game total domination for cycles and paths
- 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
- On-line Ramsey theory
- Hypergraphs with large transversal number
- Mr. Paint and Mrs. Correct
- 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
- Domination Game and an Imagination Strategy
- Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two
- ON THE COMPLEXITY OF SOME COLORING GAMES
- Toppling numbers of complete and random graphs
This page was built for publication: Transversal Game on Hypergraphs and the $\frac{3}{4}$-Conjecture on the Total Domination Game
