Pages that link to "Item:Q2357775"
From MaRDI portal
The following pages link to Trees with equal total domination and game total domination numbers (Q2357775):
Displaying 23 items.
- Characterisation of forests with trivial game domination numbers (Q326480) (← links)
- Total version of the domination game (Q497340) (← links)
- Infinite families of circular and Möbius ladders that are total domination game critical (Q1714056) (← links)
- Effect of predomination and vertex removal on the game total domination number of a graph (Q1730237) (← links)
- Domination game on uniform hypergraphs (Q1732097) (← links)
- On graphs with largest possible game domination number (Q1744764) (← links)
- Game total domination critical graphs (Q1801040) (← links)
- On domination game stable graphs and domination game edge-critical graphs (Q1801043) (← links)
- The variety of domination games (Q2007624) (← links)
- On graphs with equal total domination and Grundy total domination numbers (Q2118158) (← links)
- Predominating a vertex in the connected domination game (Q2121488) (← links)
- Fast winning strategies for the maker-breaker domination game (Q2132382) (← links)
- Game total domination for cyclic bipartite graphs (Q2312654) (← links)
- Maker-breaker domination number (Q2317950) (← links)
- Trees with equal global offensive k-alliance and k-domination numbers (Q3013257) (← links)
- An Introduction to Game Domination in Graphs (Q3384114) (← links)
- (Q4921034) (← links)
- Connected domination game (Q5028806) (← links)
- Paired-Domination Game Played in Graphs (Q5242939) (← links)
- (Q5251990) (← links)
- Connected domination game: Predomination, Staller-start game, and lexicographic products (Q5866246) (← links)
- 4-total domination game critical graphs (Q6637064) (← links)
- A note on total co-independent domination in trees (Q6641101) (← links)
