The eternal dominating set problem for interval graphs

DOI10.1016/j.ipl.2019.01.013zbMath1481.05119arXiv1808.09591OpenAlexW2963686672WikidataQ128455086 ScholiaQ128455086MaRDI QIDQ1739215

Francisco J. Soulignac, Martín Rinemberg

Publication date: 26 April 2019

Published in: Information Processing Letters (Search for Journal in Brave)

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

zbMATH Keywords

combinatorial problemsinterval graphseternal dominating setneocolonization

Mathematics Subject Classification ID

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 (4)

Eternal domination: \(D\)-dimensional Cartesian and strong grids and everything in between ⋮ A substructure based lower bound for eternal vertex cover number ⋮ A new lower bound for the eternal vertex cover number of graphs ⋮ Eternal and Secure Domination in Graphs

Cites Work

• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• A note on the eternal dominating set problem
• The eternal dominating set problem for proper interval graphs
• Protecting a graph with mobile guards
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The eternal dominating set problem for interval graphs