Pages that link to "Item:Q4715271"
From MaRDI portal
The following pages link to A Winning Strategy for the Ramsey Graph Game (Q4715271):
Displaying 13 items.
- On the clique-game (Q649002) (← links)
- Domination number of graphs without small cycles (Q659744) (← links)
- Fast winning strategies in avoider-enforcer games (Q844236) (← links)
- Domination in bipartite graphs (Q998499) (← links)
- 2-connected graphs with small 2-connected dominating sets. (Q1402083) (← links)
- Pairs of disjoint dominating sets and the minimum degree of graphs (Q1959712) (← links)
- Strong Ramsey games in unbounded time (Q1987092) (← links)
- Upper bounds on positional Paris-Harrington games (Q2222955) (← links)
- Fast winning strategies in maker-breaker games (Q2519013) (← links)
- Hitting time results for Maker-Breaker games (Q2909241) (← links)
- Building Spanning Trees Quickly in Maker-Breaker Games (Q2947437) (← links)
- Fast winning strategies in positional games (Q3503475) (← links)
- Winning Fast in Sparse Graph Construction Games (Q3608334) (← links)
