20.500.12556/RUL-181831 Criticality for Maker-Breaker domination games with predomination A predominated graph is a pair $(G,D)$, where $G$ is a graph and the vertices in $D\subseteq V(G)$ are considered already dominated. Maker-Breaker domination game critical (MBD critical) predominated graphs are introduced as the predominated graphs $(G,D)$ on which Staller wins the game, but Dominator wins on $(G, D \cup \{v\})$ for every vertex $v \in V(G) \setminus D$. Tools are developed for handling the Maker-Breaker domination game on trees which lead to a characterization of Staller-win predominated trees. MBD critical predominated trees are characterized and an algorithm is designed which verifies in linear time whether a given predominated tree is MBD critical. A large class of MBD critical predominated cacti is presented and Maker-Breaker critical hypergraphs are constructed. domination games Maker-Breaker games Maker-Breaker domination game predomination hypergraph dominacijske igre igre izdelovalec-lomilec dominacijska igra izdelovalec-lomilec predominacija hipergrafi true false true Angleški jezik Slovenski jezik Članek v reviji 2026-04-16 11:11:08 2026-04-16 11:11:11 2026-04-17 04:53:16 0000-00-00 00:00:00 2026 0 0 Str. 483-506 no. 2 Vol. 46 2026 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 2026-01-01 519.17 1234-3099 10.7151/dmgt.2615 275411971 DMGT-2615.pdf DMGT-2615.pdf 1 CE1154EF8B889465D525E0596ED3F64F 8f77708e7741092614a4a74ac8bc5a8cf30d5e4046e240c38702531d2435f539 09be8eb9-3975-11f1-b0ab-0050569b8976 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=232573 https://www.dmgt.uz.zgora.pl/publish/article.php?doi=2615 1 fc74edaf-3973-11f1-b0ab-0050569b8976 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=232570 Fakulteta za matematiko in fiziko 0 0 0