Pages that link to "Item:Q2427517"

The following pages link to Tight bounds for eternal dominating sets in graphs (Q2427517):

Displaying 27 items.

• Trees with large \(m\)-eternal domination number (Q335333) (← links)
• The guarding game is E-complete (Q389949) (← links)
• Independent protection in graphs (Q400447) (← links)
• Vertex covers and eternal dominating sets (Q423932) (← links)
• Guard games on graphs: keep the intruder out! (Q650877) (← links)
• Spy-game on graphs: complexity and simple topologies (Q1748987) (← links)
• A note on the eternal dominating set problem (Q1791289) (← links)
• Efficient and non-efficient domination of \(\mathbb{Z}\)-stacked Archimedean lattices (Q2089545) (← links)
• Eternal domination on prisms of graphs (Q2192128) (← links)
• A substructure based lower bound for eternal vertex cover number (Q2235736) (← links)
• Graphs with equal eternal vertex cover and eternal domination numbers (Q2275369) (← links)
• Eternally dominating large grids (Q2328863) (← links)
• Domination, eternal domination, and clique covering (Q2344016) (← links)
• Exact algorithms for weak Roman domination (Q2413969) (← links)
• To satisfy impatient web surfers is hard (Q2437758) (← links)
• Spy game: FPT-algorithm, hardness and graph products (Q2672629) (← links)
• Spy game: FPT-algorithm and results on graph products (Q2695339) (← links)
• Dynamic dominating sets: the eviction model for eternal domination (Q2829356) (← links)
• Foolproof eternal domination in the all-guards move model (Q2905572) (← links)
• Eternal and Secure Domination in Graphs (Q3384616) (← links)
• (Q3635564) (← links)
• On eternal domination and Vizing-type inequalities (Q5012368) (← links)
• A Dynamic Domination Problem (Q5069748) (← links)
• A dynamic domination problem in trees (Q5134345) (← links)
• Secure vertex cover of a graph (Q5347260) (← links)
• A new lower bound for the eternal vertex cover number of graphs (Q5918525) (← links)
• Eternal distance-\(k\) domination on graphs (Q6108933) (← links)