A method for eternally dominating strong grids
In the eternal domination game, an attacker attacks a vertex at each turn and a team of guards must move a guard to the attacked vertex to defend it. The guards may only move to adjacent vertices and no more than one guard may occupy a vertex. The goal is to determine the eternal domination number o...
Main Authors: | Alizée Gagnon, Alexander Hassler, Jerry Huang, Aaron Krim-Yee, Fionn Mc Inerney, Andrés Zacarías, Ben Seamone, Virgélot Virgile |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2020-03-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/5162/pdf |
Similar Items
-
(k − 2)-linear connected components in hypergraphs of rank k
by: Florian Galliot, et al.
Published: (2023-11-01) -
On Kerov polynomials for Jack characters (extended abstract)
by: Valentin Féray, et al.
Published: (2013-01-01) -
Staircase Macdonald polynomials and the $q$-Discriminant
by: Adrien Boussicault, et al.
Published: (2008-01-01) -
Counting Polyominoes on Twisted Cylinders
by: Gill Barequet, et al.
Published: (2005-01-01) -
Colouring random geometric graphs
by: Colin J. H. McDiarmid, et al.
Published: (2005-01-01)