scientific article; zbMATH DE number 5575574
From MaRDI portal
Publication:3635564
zbMATH Open1176.05057MaRDI QIDQ3635564FDOQ3635564
Authors: William F. Klostermeyer, Gary MacGillivray
Publication date: 6 July 2009
Title of this publication is not available (Why is that?)
Recommendations
- Eternal dominating sets in Kneser graphs
- Eternal dominating sets on digraphs and orientations of graphs
- Tight bounds for eternal dominating sets in graphs
- Eternal total domination in graphs.
- Connected eternal domination in graphs
- The eternal dominating set problem for interval graphs
- The eternal dominating set problem for proper interval graphs
- Eternal domination in split graphs
- A note on the eternal dominating set problem
- Eternal and Secure Domination in Graphs
independence numberclique covering numberguardsdefending treeseternal domination probleminfinite sequence of attacks
Cited In (40)
- Study of a combinatorial game in graphs through linear programming
- Study of a combinatorial game in graphs through linear programming
- Independent protection in graphs
- A note on the eternal dominating set problem
- A dynamic domination problem in trees
- Eternal domination in split graphs
- On the \(m\)-eternal domination number of cactus graphs
- The game of cops and eternal robbers
- The eternal dominating set problem for interval graphs
- Spy-game on graphs: complexity and simple topologies
- Maximum-demand graphs for eternal security
- The eternal dominating set problem for proper interval graphs
- The eternal domination number for \(3\times n\) grid graphs
- Eternal and Secure Domination in Graphs
- Eternal domination of generalized Petersen graph
- Tight bounds for eternal dominating sets in graphs
- Graphs with equal eternal vertex cover and eternal domination numbers
- Title not available (Why is that?)
- Trees with large \(m\)-eternal domination number
- A method for eternally dominating strong grids
- Vertex covers and eternal dominating sets
- Eternal domination: \(D\)-dimensional Cartesian and strong grids and everything in between
- Spy game: FPT-algorithm, hardness and graph products
- Spy game: FPT-algorithm and results on graph products
- On eternal domination and Vizing-type inequalities
- Eternal domination and clique covering
- Eternal dominating sets in Kneser graphs
- \(m\)-eternal total domination in graphs
- \(m\)-secure vertex cover of a graph
- Secure vertex cover of a graph
- Eternal domination: criticality and reachability
- Eternal distance-\(k\) domination on graphs
- Eternal domination on prisms of graphs
- A Dynamic Domination Problem
- Eternal Independent Sets in Graphs
- Domination, eternal domination, and clique covering
- Eternal domination in trees
- Application of eternal domination in epidemiology
- Eternal dominating sets on digraphs and orientations of graphs
- The guarding game is E-complete
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3635564)