Tandem-win graphs
From MaRDI portal
Publication:2568474
Recommendations
Cites work
Cited in
(15)- A witness version of the cops and robber game
- On distance-preserving elimination orderings in graphs: complexity and algorithms
- Limited visibility cops and robber
- A survey on the relationship between the game of cops and robbers and other game representations
- Elimination schemes and lattices
- Characterizations of k-copwin graphs
- An introduction to lazy cops and robbers on graphs
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth
- The game of Cops and Robber on circulant graphs
- A Tandem version of the Cops and Robber Game played on products of graphs
- The damage number of the Cartesian product of graphs
- Cops and attacking robbers with cycle constraints
- Corrigendum to: ``The damage number of the Cartesian product of graphs
- Surrounding an active robber
- An annotated bibliography on guaranteed graph searching
This page was built for publication: Tandem-win graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2568474)