Cops and robber on oriented graphs with respect to push operation

DOI10.1007/978-3-031-25211-2_24MaRDI QIDQ6132547

Harmender Gahlawat, Sandip Das, Uma kant Sahoo, Ashwin Ramgopal, Sagnik Sen

Publication date: 17 August 2023

Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• A unified approach for gathering and exclusive searching on rings under weak assumptions
• The complexity of pursuit on a graph
• Bounds on the length of a game of cops and robbers
• A game of cops and robbers
• Cop-win graphs with maximum capture-time
• On graphs that can be oriented as diagrams of ordered sets
• On reorienting graphs by pushing down maximal vertices
• On a pursuit game on Cayley digraphs
• Graph searching and a min-max theorem for tree-width
• A comparison of structural CSP decomposition methods
• Game of cops and robbers in oriented quotients of the integer grid
• Cops and robbers on directed and undirected abelian Cayley graphs
• Cops and robbers on oriented toroidal grids
• Detecting fixed patterns in chordal graphs in polynomial time
• Cops and robbers is EXPTIME-complete
• A note on \(k\)-cop, \(l\)-robber games on graphs
• Variations on cops and robbers
• The complexity of acyclic conjunctive queries
• Hamiltonicity and reversing arcs in digraphs
• Tournament games and positive tournaments
• Cops and Robbers on Planar‐Directed Graphs
• Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs
• Evacuating Robots via Unknown Exit in a Disk
• Cops and robber on some families of oriented graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cops and robber on oriented graphs with respect to push operation