Maker-breaker domination number for Cartesian products of path graphs P₂ and P_n
DOI10.46298/DMTCS.10465zbMATH Open1546.0511MaRDI QIDQ6599808FDOQ6599808
Authors: Jovana Forcan, Jiayue Qi
Publication date: 6 September 2024
Published in: Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)
Recommendations
positional gamemaker-breaker domination gamemaker-breaker domination number for gridswinning strategy on grids
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Domination game and an imagination strategy
- Positional games
- Combinatorial Games
- On a combinatorial game
- Fast winning strategies in maker-breaker games
- Fast strategies in maker-breaker games played on random boards
- Maker-Breaker domination game
- Maker-breaker domination number
- Building spanning trees quickly in maker-breaker games
This page was built for publication: Maker-breaker domination number for Cartesian products of path graphs \(P_2\) and \(P_n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6599808)