Pages that link to "Item:Q2156313"
From MaRDI portal
The following pages link to A simple method for proving lower bounds in the zero-visibility cops and robber game (Q2156313):
Displaying 6 items.
- The complexity of zero-visibility cops and robber (Q897941) (← links)
- Computing the one-visibility copnumber of trees (Q2039691) (← links)
- Computing the one-visibility cop-win strategies for trees (Q2149861) (← links)
- A partition approach to lower bounds for zero-visibility cops and robber (Q2301762) (← links)
- Zero-visibility cops and robber and the pathwidth of a graph (Q2343977) (← links)
- The zero-visibility cops and robber game on graph products (Q6564028) (← links)