Pages that link to "Item:Q2275369"
From MaRDI portal
The following pages link to Graphs with equal eternal vertex cover and eternal domination numbers (Q2275369):
Displaying 14 items.
- Independent protection in graphs (Q400447) (← links)
- Vertex covers and eternal dominating sets (Q423932) (← links)
- Spy-game on graphs: complexity and simple topologies (Q1748987) (← links)
- Eternal vertex cover on bipartite graphs (Q2097214) (← links)
- On graphs whose eternal vertex cover number and vertex cover number coincide (Q2161248) (← links)
- A substructure based lower bound for eternal vertex cover number (Q2235736) (← links)
- Eternally dominating large grids (Q2328863) (← links)
- Spy game: FPT-algorithm, hardness and graph products (Q2672629) (← links)
- Spy game: FPT-algorithm and results on graph products (Q2695339) (← links)
- Eternal and Secure Domination in Graphs (Q3384616) (← links)
- m-Secure vertex cover of a graph (Q4644785) (← links)
- A Dynamic Domination Problem (Q5069748) (← links)
- A dynamic domination problem in trees (Q5134345) (← links)
- A new lower bound for the eternal vertex cover number of graphs (Q5918525) (← links)