Pages that link to "Item:Q326647"
From MaRDI portal
The following pages link to Bounds on the game transversal number in hypergraphs (Q326647):
Displaying 16 items.
- On the game total domination number (Q1637096) (← links)
- The matcher game played in graphs (Q1701097) (← links)
- Domination game and minimal edge cuts (Q1727767) (← links)
- Domination game on uniform hypergraphs (Q1732097) (← links)
- Connected domination game played on Cartesian products (Q2111699) (← links)
- General upper bound on the game domination number (Q2197467) (← links)
- Bounds on upper transversals in hypergraphs (Q2292129) (← links)
- Fractional domination game (Q2327216) (← links)
- Trees with equal total domination and game total domination numbers (Q2357775) (← links)
- A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals (Q2700612) (← links)
- Transversal game on hypergraphs and the \(\frac{3}{4}\)-conjecture on the total domination game (Q2821619) (← links)
- An Introduction to Game Domination in Graphs (Q3384114) (← links)
- Paired-Domination Game Played in Graphs (Q5242939) (← links)
- The \((a, b)\)-monochromatic transversal game on clique-hypergraphs of powers of cycles (Q6550916) (← links)
- Optimal strategies in fractional games: vertex cover and domination (Q6617233) (← links)
- A proof of the 3/4-conjecture for the total domination game (Q6668346) (← links)
