Pages that link to "Item:Q307770"
From MaRDI portal
The following pages link to On the complexity of connection games (Q307770):
Displaying 8 items.
- Game connectivity of graphs (Q2198411) (← links)
- A connectivity game for graphs (Q2386339) (← links)
- Havannah and TwixT are PSPACE-complete (Q2947922) (← links)
- Calculating the Crossing Probability on the Square Tessellation of a Connection Game with Random Move Order: The Algorithm and Its Complexity (Q3188856) (← links)
- The largest connected subgraph game (Q5918781) (← links)
- The largest connected subgraph game (Q5925553) (← links)
- The maker-maker domination game in forests (Q6124422) (← links)
- Complexity of maker-breaker games on edge sets of graphs (Q6657252) (← links)
