The following pages link to Tandem-win graphs (Q2568474):
Displaying 10 items.
- Characterizations of \(k\)-copwin graphs (Q408176) (← links)
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth (Q494802) (← links)
- The game of Cops and Robber on circulant graphs (Q528556) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- A witness version of the cops and robber game (Q1025953) (← links)
- On distance-preserving elimination orderings in graphs: complexity and algorithms (Q1752455) (← links)
- Limited visibility cops and robber (Q2185730) (← links)
- A survey on the relationship between the game of cops and robbers and other game representations (Q2280205) (← links)
- Elimination schemes and lattices (Q2449178) (← links)
- An Introduction to Lazy Cops and Robbers on Graphs (Q4581686) (← links)
