Pages that link to "Item:Q521751"
From MaRDI portal
The following pages link to How long can one bluff in the domination game? (Q521751):
Displaying 12 items.
- The switch operators and push-the-button games: a sequential compound over rulesets (Q683756) (← links)
- Domination game and minimal edge cuts (Q1727767) (← links)
- Cutting lemma and union lemma for the domination game (Q1727804) (← 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)
- Connected domination game played on Cartesian products (Q2111699) (← links)
- Z-domination game (Q2198397) (← links)
- An Introduction to Game Domination in Graphs (Q3384114) (← links)
- Mycielskian of graphs with small game domination number (Q5058212) (← links)
