Pages that link to "Item:Q313955"
From MaRDI portal
The following pages link to Complexity of the game domination problem (Q313955):
Displaying 8 items.
- Infinite families of circular and Möbius ladders that are total domination game critical (Q1714056) (← links)
- Cutting lemma and union lemma for the domination game (Q1727804) (← links)
- On graphs with largest possible game domination number (Q1744764) (← links)
- Game total domination critical graphs (Q1801040) (← links)
- The variety of domination games (Q2007624) (← links)
- Fractional domination game (Q2327216) (← links)
- The game total domination problem is log-complete in PSPACE (Q2361492) (← links)
- An Introduction to Game Domination in Graphs (Q3384114) (← links)
