Cover Image

Accelerated Cops and Robbers

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kinnersley, William B., Townsend, Nikolas
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Primal-Dual Cops and Robber
by: Ha, Minh Tuan, et al.
Published: (2023)

$k$-Hyperopic Cops and Robber
by: Crawford, Nicholas, et al.
Published: (2024)

Cops and Robbers for Graphs on Surfaces with Crossings
by: Bose, Prosenjit, et al.
Published: (2025)

Cops and Robber -- When Capturing is not Surrounding
by: Jungeblut, Paul, et al.
Published: (2023)

Pushing Cops and Robber on Graphs of Maximum Degree 4
by: Gahlawat, Harmender
Published: (2025)

Fast and Furious: A study on Monotonicity and Speed in Cops-and-Robber Games
by: Fluck, Eva, et al.
Published: (2025)

Cops and Attacking Robbers with Cycle Constraints
by: Clow, Alexander, et al.
Published: (2024)

Guarding isometric subgraphs and Cops and Robber in planar graphs
by: de la Maza, Sebastián González Hermosillo, et al.
Published: (2024)

Cops and Robbers on Multi-Layer Graphs
by: Enright, Jessica, et al.
Published: (2023)

Cops & Robber on Periodic Temporal Graphs
by: De Carufel, Jean-Lou, et al.
Published: (2024)

Cops and Robbers, Clique Covers, and Induced Cycles
by: Clow, Alexander, et al.
Published: (2025)

Cop numbers of periodic graphs
by: De Carufel, Jean-Lou, et al.
Published: (2023)

On the Cop Number of String Graphs
by: Das, Sandip, et al.
Published: (2024)

Limited-visibility Cops and Robbers on Hamming graphs
by: Jones, John, et al.
Published: (2025)

On 1-Planar Graphs with Bounded Cop-Number
by: Bose, Prosenjit, et al.
Published: (2024)

Cops and robber in graphs with bounded vertex cover number
by: Bose, Prosenjit, et al.
Published: (2026)

Capturing an Invisible Robber using Separators
by: Potapov, Igor, et al.
Published: (2025)

Flip-width: Cops and Robber on dense graphs
by: Toruńczyk, Szymon
Published: (2023)

Cops and robbers on $P_5$-free graphs
by: Chudnovsky, Maria, et al.
Published: (2023)

On the Multi-Robber Damage Number
by: Stojaković, Miloš, et al.
Published: (2022)

Flips and Merge-Width in Sparse Graphs
by: Drabik, Karolina, et al.
Published: (2026)

Cops against a cheating robber
by: Clarke, Nancy E., et al.
Published: (2024)

Concepts of Dimension for Convex Geometries
by: Knauer, Kolja, et al.
Published: (2023)

Forbidden Induced Subgraphs for Bounded Shrub-Depth and the Expressive Power of MSO
by: Mählmann, Nikolas
Published: (2025)

On the expansion of Hanoi graphs
by: Eppstein, David, et al.
Published: (2025)

Nucleation-free independent graphs with implied nonedges
by: Cheng, Jialong, et al.
Published: (2025)

Cube Height, Cube Width and Related Extremal Problems for Posets
by: Bastide, Paul, et al.
Published: (2025)

Reachability in temporal graphs under perturbation
by: Enright, Jessica, et al.
Published: (2024)

The Bottleneck Birthday Problem
by: Tripathy, Chijul B.
Published: (2025)

Throttling for metric dimension and its variants
by: Brimkov, Boris, et al.
Published: (2025)

Bounds on the Complete Forcing Number of Graphs
by: Ebrahimi, Javad B., et al.
Published: (2024)

On the existence of $δ$-temporal cliques in random simple temporal graphs
by: Mertzios, George B., et al.
Published: (2024)

Existential Positive Transductions of Sparse Graphs
by: Mählmann, Nikolas, et al.
Published: (2026)

Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
by: Foucaud, Florent, et al.
Published: (2024)

A Proof of the 2004 Albert-Grossman-Nowakowski-Wolfe Conjecture on Alternating Linear Clobber
by: Chen, Xinyue, et al.
Published: (2025)

Expected Length of the Longest Common Subsequence of Multiple Strings
by: Li, Ray, et al.
Published: (2025)

Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes
by: Dreier, Jan, et al.
Published: (2024)

Boundedness and Separation in the Graph Covering Number Framework
by: Goetze, Miriam, et al.
Published: (2025)

On graphs with a simple structure of maximal cliques
by: Gollin, J. Pascal, et al.
Published: (2025)

Determining a graph from its reconfiguration graph
by: Berthe, Gaétan, et al.
Published: (2025)