Distance d-Domination Games

DOI10.1007/978-3-642-11409-0_27zbMath1200.68172MaRDI QIDQ5851115

Stephan Kreutzer, Sebastian Ordyniak

Publication date: 21 January 2010

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11409-0_27

Mathematics Subject Classification ID

91A43: Games involving graphs

68R10: Graph theory (including graph drawing) in computer science

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

05C57: Games on graphs (graph-theoretic aspects)

Related Items

Complexity and monotonicity results for domination games, Jumping robbers in digraphs, DAG-width is PSPACE-complete, Which graphs occur as \(\gamma\)-graphs?