Complexity of Maker–Breaker games on edge sets of graphs - Duchêne, Eric; Gledel, Valentin; Mc Inerney, Fionn; Nisse, Nicolas; Oijid, Nacim; Parreau, Aline; Stojaković, Miloš (Discrete Applied Mathematics, 2025)
Keywords: [formula omitted]-game; [formula omitted]-hard; Computational complexity; Computer Science; formula omitted; Maker–Breaker games; Perfect matching game; H-game; Maker–Breaker games; PSPACE-hard; FPT; Perfect matching game; Computational complexity; Maker-Breaker Games; Perfect Matching Game; Connectivity Game; Computational Complexity