The following pages link to (Q4681994):
Displaying 46 items.
- Changing and unchanging in \(m\)-eternal total domination in graphs (Q327647) (← links)
- 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)
- Eternal domination: criticality and reachability (Q505466) (← links)
- Guard games on graphs: keep the intruder out! (Q650877) (← links)
- Secondary domination in graphs (Q1011873) (← links)
- Secure domination critical graphs (Q1045117) (← links)
- Eternal \(m\)-security bondage numbers in graphs (Q1656913) (← links)
- The eternal dominating set problem for interval graphs (Q1739215) (← links)
- Spy-game on graphs: complexity and simple topologies (Q1748987) (← links)
- A note on the eternal dominating set problem (Q1791289) (← links)
- Study of a combinatorial game in graphs through linear programming (Q1986957) (← links)
- The game of cops and eternal robbers (Q2034413) (← links)
- Eternal domination of generalized Petersen graph (Q2034695) (← links)
- On eternal domination of generalized \(J_{s,m}\) (Q2039883) (← links)
- A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees (Q2223687) (← 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)
- A survey on the relationship between the game of cops and robbers and other game representations (Q2280205) (← links)
- Eternally dominating large grids (Q2328863) (← links)
- Domination, eternal domination, and clique covering (Q2344016) (← links)
- The eternal dominating set problem for proper interval graphs (Q2345856) (← links)
- Exact algorithms for weak Roman domination (Q2413969) (← links)
- Tight bounds for eternal dominating sets in graphs (Q2427517) (← links)
- Eternal dominating sets on digraphs and orientations of graphs (Q2659065) (← links)
- Eternal domination: \(D\)-dimensional Cartesian and strong grids and everything in between (Q2663714) (← links)
- Spy game: FPT-algorithm, hardness and graph products (Q2672629) (← links)
- Spy game: FPT-algorithm and results on graph products (Q2695339) (← links)
- \(m\)-eternal total domination in graphs (Q2821121) (← links)
- Dynamic dominating sets: the eviction model for eternal domination (Q2829356) (← links)
- (Q3095864) (← links)
- Eternal and Secure Domination in Graphs (Q3384616) (← links)
- Disjoint dominating sets with a perfect matching (Q4595255) (← links)
- m-Secure vertex cover of a graph (Q4644785) (← links)
- On eternal domination and Vizing-type inequalities (Q5012368) (← links)
- Eternal domination and clique covering (Q5054057) (← links)
- A Dynamic Domination Problem (Q5069748) (← links)
- (Q5109047) (← links)
- A method for eternally dominating strong grids (Q5130743) (← links)
- A dynamic domination problem in trees (Q5134345) (← links)
- (Q5136239) (← links)
- Secure vertex cover of a graph (Q5347260) (← links)
- A new lower bound for the eternal vertex cover number of graphs (Q5918525) (← links)
- Eternal feedback vertex sets: a new graph protection model using guards (Q6560780) (← links)
