Pages that link to "Item:Q2301762"
From MaRDI portal
The following pages link to A partition approach to lower bounds for zero-visibility cops and robber (Q2301762):
Displayed 4 items.
- Computing the one-visibility copnumber of trees (Q2039691) (← links)
- One-visibility cops and robber on trees: optimal cop-win strategies (Q2079862) (← links)
- A simple method for proving lower bounds in the zero-visibility cops and robber game (Q2156313) (← links)
- One-visibility cops and robber on trees (Q2232598) (← links)