The eternal dominating set problem for interval graphs
Discrete Mathematics
2018-08-30 v1 Combinatorics
Abstract
We prove that, in games in which all the guards move at the same turn, the eternal domination and the clique-connected cover numbers coincide for interval graphs. A linear algorithm for the eternal dominating set problem is obtained as a by-product.
Keywords
Cite
@article{arxiv.1808.09591,
title = {The eternal dominating set problem for interval graphs},
author = {Martín Rinemberg and Francisco J. Soulignac},
journal= {arXiv preprint arXiv:1808.09591},
year = {2018}
}
Comments
3 pages, one figure