Domination Games Played on Graphs

DOI10.1007/978-3-030-69087-8zbMath1467.91015OpenAlexW3154464724MaRDI QIDQ5855541

Boštjan Brešar, Michael A. Henning, Sandi Klavžar, Douglas F. Rall

Publication date: 18 March 2021

Published in: SpringerBriefs in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-69087-8

zbMATH Keywords

graphhypergraphdomination game

Mathematics Subject Classification ID

Hypergraphs (05C65) Games involving graphs (91A43) Games in extensive form (91A18) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (8)

Predominating a vertex in the connected domination game ⋮ Paired-domination game played on cycles ⋮ Graphs with equal Grundy domination and independence number ⋮ Bounds for the competition-independence game on trees ⋮ Computation of Grundy dominating sequences in (co-)bipartite graphs ⋮ The enclaveless competition game ⋮ An Introduction to Game Domination in Graphs ⋮ Connected domination game: Predomination, Staller-start game, and lexicographic products

This page was built for publication: Domination Games Played on Graphs