The following pages link to (Q2940127):
Displaying 5 items.
- Three ways to cover a graph (Q898135) (← 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)
- Coverability of graph by three odd subgraphs (Q5207471) (← links)
- A new lower bound for the eternal vertex cover number of graphs (Q5918525) (← links)