Cops and robber on oriented graphs with respect to push operation
From MaRDI portal
Publication:6132547
Cites work
- scientific article; zbMATH DE number 3650583 (Why is no real title available?)
- scientific article; zbMATH DE number 17787 (Why is no real title available?)
- scientific article; zbMATH DE number 3590298 (Why is no real title available?)
- scientific article; zbMATH DE number 3411070 (Why is no real title available?)
- A comparison of structural CSP decomposition methods
- A game of cops and robbers
- A note on \(k\)-cop, \(l\)-robber games on graphs
- A unified approach for gathering and exclusive searching on rings under weak assumptions
- Bounds on the length of a game of cops and robbers
- Cop-win graphs with maximum capture-time
- Cops and Robbers on Planar‐Directed Graphs
- Cops and robber on some families of oriented graphs
- Cops and robbers is EXPTIME-complete
- Cops and robbers on directed and undirected abelian Cayley graphs
- Cops and robbers on oriented graphs
- Cops and robbers on oriented toroidal grids
- Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs
- Detecting fixed patterns in chordal graphs in polynomial time
- Evacuating robots via unknown exit in a disk
- Game of cops and robbers in oriented quotients of the integer grid
- Graph searching and a min-max theorem for tree-width
- Hamiltonicity and reversing arcs in digraphs
- On a pursuit game on Cayley digraphs
- On graphs that can be oriented as diagrams of ordered sets
- On reorienting graphs by pushing down maximal vertices
- Pushing vertices and orienting edges
- Re-orienting tournaments by pushing vertices.
- The complexity of acyclic conjunctive queries
- The complexity of pursuit on a graph
- Tournament games and positive tournaments
- Variations on cops and robbers
This page was built for publication: Cops and robber on oriented graphs with respect to push operation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132547)
