Pages that link to "Item:Q2361492"
From MaRDI portal
The following pages link to The game total domination problem is log-complete in PSPACE (Q2361492):
Displayed 9 items.
- Infinite families of circular and Möbius ladders that are total domination game critical (Q1714056) (← links)
- Domination game and minimal edge cuts (Q1727767) (← links)
- Effect of predomination and vertex removal on the game total domination number of a graph (Q1730237) (← links)
- Game total domination critical graphs (Q1801040) (← links)
- Maker-breaker total domination game (Q2185735) (← links)
- Game total domination for cyclic bipartite graphs (Q2312654) (← links)
- An Introduction to Game Domination in Graphs (Q3384114) (← links)
- Total connected domination game (Q5161631) (← links)
- Paired-Domination Game Played in Graphs (Q5242939) (← links)