scientific article
From MaRDI portal
zbMath1176.05057MaRDI QIDQ3635564
Gary MacGillivray, William F. Klostermeyer
Publication date: 6 July 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
independence numberclique covering numberguardsdefending treeseternal domination probleminfinite sequence of attacks
Related Items
Eternal domination and clique covering, Trees with large \(m\)-eternal domination number, A Dynamic Domination Problem, Eternal dominating sets on digraphs and orientations of graphs, Eternal domination: \(D\)-dimensional Cartesian and strong grids and everything in between, The guarding game is E-complete, Spy game: FPT-algorithm, hardness and graph products, Secure vertex cover of a graph, Independent protection in graphs, Eternal distance-\(k\) domination on graphs, Tight bounds for eternal dominating sets in graphs, Vertex covers and eternal dominating sets, Spy game: FPT-algorithm and results on graph products, The eternal dominating set problem for interval graphs, Eternal domination: criticality and reachability, Study of a combinatorial game in graphs through linear programming, m-Secure vertex cover of a graph, Spy-game on graphs: complexity and simple topologies, Graphs with equal eternal vertex cover and eternal domination numbers, A note on the eternal dominating set problem, The game of cops and eternal robbers, A method for eternally dominating strong grids, A dynamic domination problem in trees, Unnamed Item, Eternal and Secure Domination in Graphs, Unnamed Item, On eternal domination and Vizing-type inequalities, Domination, eternal domination, and clique covering, The eternal dominating set problem for proper interval graphs
