The enclaveless competition game
From MaRDI portal
Publication:5156013
DOI10.26493/1855-3974.2227.e1azbMath1475.05119arXiv2006.02829OpenAlexW3106283588MaRDI QIDQ5156013
Michael A. Henning, Douglas F. Rall
Publication date: 14 October 2021
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.02829
2-person games (91A05) Hypergraphs (05C65) Games involving graphs (91A43) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Domination game: extremal families for the 3/5-conjecture for forests
- On the game domination number of graphs with given minimum degree
- Independence and upper irredundance in claw-free graphs
- Realizations of the game domination number
- Competition parameters of a graph
- Domination game on forests
- The 3/5-conjecture for weakly \(S(K_{1, 3})\)-free forests
- Domination Game and an Imagination Strategy
- Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two
- Enclaveless sets and MK-Systems
- Properties of Hereditary Hypergraphs and Middle Graphs
- Domination game on paths and cycles
- Edge Weighting Functions on Dominating Sets
- My Favorite Domination Game Conjectures
- Extremal Problems for Game Domination Number
- Domination Games Played on Graphs
This page was built for publication: The enclaveless competition game
