Pages that link to "Item:Q2800503"
From MaRDI portal
The following pages link to On the computational complexity of the domination game (Q2800503):
Displaying 11 items.
- Complexity and monotonicity results for domination games (Q266262) (← links)
- Complexity of the game domination problem (Q313955) (← links)
- The complexity of free-flood-it on \(2\times n\) boards (Q388453) (← links)
- Further progress on the heredity of the game domination number (Q1683591) (← links)
- The game total domination problem is log-complete in PSPACE (Q2361492) (← links)
- Restricted Power - Computational Complexity Results for Strategic Defense Games (Q3305735) (← links)
- (Q3341896) (← links)
- An Introduction to Game Domination in Graphs (Q3384114) (← links)
- On the Complexity of n-Player Hackenbush (Q3400102) (← links)
- Domino Games and Complexity (Q3495644) (← links)
- (Q4964810) (← links)