The following pages link to (Q4820838):
Displayed 39 items.
- Changing and unchanging in \(m\)-eternal total domination in graphs (Q327647) (← links)
- Upper secure domination number of a graph (Q327666) (← 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)
- Roman domination problem with uncertain positioning and deployment costs (Q781325) (← links)
- Irredundance, secure domination and maximum degree in trees (Q861788) (← 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)
- Edge criticality in secure graph domination (Q1751134) (← links)
- A note on the eternal dominating set problem (Q1791289) (← links)
- Study of a combinatorial game in graphs through linear programming (Q1986957) (← links)
- Eternal domination of generalized Petersen graph (Q2034695) (← links)
- On eternal domination of generalized \(J_{s,m}\) (Q2039883) (← links)
- Limit theory of combinatorial optimization for random geometric graphs (Q2075326) (← links)
- Eternal domination on prisms of graphs (Q2192128) (← 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)
- Co-Roman domination in graphs (Q2344075) (← links)
- The eternal dominating set problem for proper interval graphs (Q2345856) (← links)
- Tight bounds for eternal dominating sets in graphs (Q2427517) (← links)
- A linear algorithm for secure domination in trees (Q2449101) (← links)
- Secure restrained domination in graphs (Q2516512) (← 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)
- Eternal and Secure Domination in Graphs (Q3384616) (← links)
- On eternal domination and Vizing-type inequalities (Q5012368) (← links)
- Eternal domination and clique covering (Q5054057) (← links)
- A Dynamic Domination Problem (Q5069748) (← links)
- Further results on secure restrained domination in graphs (Q5069776) (← links)
- A method for eternally dominating strong grids (Q5130743) (← links)
- A dynamic domination problem in trees (Q5134345) (← links)
- (Q5136239) (← links)
- On minimum secure dominating sets of graphs (Q5233913) (← links)