Cops, a fast robber and defensive domination on interval graphs
From MaRDI portal
Publication:2328864
DOI10.1016/j.tcs.2018.09.031zbMath1433.91033OpenAlexW2899632040WikidataQ128980722 ScholiaQ128980722MaRDI QIDQ2328864
Jan Kratochvíl, Tomáš Gavenčiak, Dariusz Dereniowski
Publication date: 16 October 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2018.09.031
2-person games (91A05) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Combinatorial games (91A46) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (5)
Approximation algorithm and hardness results for defensive domination in graphs ⋮ Catching an infinitely fast robber on a grid ⋮ Cops and robber on butterflies, grids, and AT-free graphs ⋮ Defensive domination in proper interval graphs ⋮ The complexity of the defensive domination problem in special graph classes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The fast robber on interval and chordal graphs
- Cops and robbers from a distance
- On a generalization of Meyniel's conjecture on the Cops and Robbers game
- The complexity of zero-visibility cops and robber
- A short note about pursuit games played on a graph with a given genus
- Vertex-to-vertex pursuit in a graph
- Cops and Robber game with a fast robber on expander graphs and random graphs
- Pursuing a fast robber on a graph
- Zero-visibility cops and robber and the pathwidth of a graph
- Variations on cops and robbers
- Catching a Fast Robber on Interval Graphs
- Cop and Robber Games When the Robber Can Hide and Ride
- An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
- Lower Bounds for the Cop Number when the Robber is Fast
- Fast Robber in Planar Graphs
- Randomized Pursuit-Evasion with Local Visibility
This page was built for publication: Cops, a fast robber and defensive domination on interval graphs
