Pages that link to "Item:Q326480"
From MaRDI portal
The following pages link to Characterisation of forests with trivial game domination numbers (Q326480):
Displaying 24 items.
- Complexity of the game domination problem (Q313955) (← links)
- How long can one bluff in the domination game? (Q521751) (← links)
- Infinite families of circular and Möbius ladders that are total domination game critical (Q1714056) (← links)
- Domination game and minimal edge cuts (Q1727767) (← links)
- Cutting lemma and union lemma for the domination game (Q1727804) (← links)
- Effect of predomination and vertex removal on the game total domination number of a graph (Q1730237) (← 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)
- \( 1 / 2\)-conjectures on the domination game and claw-free graphs (Q2066003) (← links)
- On graphs with equal total domination and Grundy total domination numbers (Q2118158) (← links)
- The domination game played on diameter 2 graphs (Q2118161) (← links)
- Predominating a vertex in the connected domination game (Q2121488) (← links)
- Fast winning strategies for the maker-breaker domination game (Q2132382) (← links)
- Maker-breaker total domination game (Q2185735) (← links)
- General upper bound on the game domination number (Q2197467) (← links)
- Z-domination game (Q2198397) (← links)
- Maker-breaker domination number (Q2317950) (← links)
- Fractional domination game (Q2327216) (← links)
- Trees with equal total domination and game total domination numbers (Q2357775) (← links)
- The 3/5-conjecture for weakly \(S(K_{1, 3})\)-free forests (Q2629288) (← links)
- Perfect graphs for domination games (Q2660136) (← links)
- An Introduction to Game Domination in Graphs (Q3384114) (← links)
