Distance d-Domination Games

DOI10.1007/978-3-642-11409-0_27zbMath1200.68172OpenAlexW1780034447MaRDI 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

Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (4)

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

This page was built for publication: Distance d-Domination Games