Eternally dominating large grids

DOI10.1016/j.tcs.2018.09.008zbMath1433.05225arXiv1611.08204OpenAlexW2890955227MaRDI QIDQ2328863

Sven Schewe, Russell Martin, Ioannis Lamprou

Publication date: 16 October 2019

Published in: Theoretical Computer Science, Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.08204

zbMATH Keywords

gridcombinatorial gameeternal dominationgraph protectiontwo players

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (8)

Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination ⋮ Eternal domination: \(D\)-dimensional Cartesian and strong grids and everything in between ⋮ Eternal distance-\(k\) domination on graphs ⋮ Study of a combinatorial game in graphs through linear programming ⋮ The game of cops and eternal robbers ⋮ A method for eternally dominating strong grids ⋮ Eternal and Secure Domination in Graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Trees with large \(m\)-eternal domination number
• Vertex covers and eternal dominating sets
• Parameterized algorithm for eternal vertex cover
• A note on the eternal dominating set problem
• Defending the Roman Empire---a new strategy
• Graphs with equal eternal vertex cover and eternal domination numbers
• Connected surveillance game
• Tight bounds for eternal dominating sets in graphs
• To satisfy impatient web surfers is hard
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• The Domination Number of Grids
• An Eternal Domination Problem in Grids
• Protecting a graph with mobile guards

This page was built for publication: Eternally dominating large grids