Cover Image

Cops and Robbers on Multi-Layer Graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Enright, Jessica, Meeks, Kitty, Pettersson, William, Sylvester, John
Format:	Preprint
Published:	2023
Subjects:	Combinatorics Discrete Mathematics Data Structures and Algorithms 05C57 (Primary), 68R10 (Secondary)
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Tangled Paths: A Random Graph Model from Mallows Permutations
by: Enright, Jessica, et al.
Published: (2021)

Solving the Graph Burning Problem for Large Graphs
by: Pereira, Felipe de Carvalho, et al.
Published: (2024)

Bounds on the Twin-Width of Product Graphs
by: Pettersson, William, et al.
Published: (2022)

A scalable clustering algorithm to approximate graph cuts
by: Suchan, Leo, et al.
Published: (2023)

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

Adjacency Labeling Schemes for Small Classes
by: Bonnet, Édouard, et al.
Published: (2024)

On algorithmic applications of sim-width and mim-width of $(H_1, H_2)$-free graphs
by: Munaro, Andrea, et al.
Published: (2022)

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

The damage number of the Cartesian product of graphs
by: Huggan, Melissa A., et al.
Published: (2023)

Tight bounds on adjacency labels for monotone graph classes
by: Bonnet, Édouard, et al.
Published: (2023)

Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes
by: Bonnet, Édouard, et al.
Published: (2023)

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

Directed Temporal Tree Realization for Periodic Public Transport: Easy and Hard Cases
by: Meusel, Julia, et al.
Published: (2025)

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

Degree Realization by Bipartite Cactus Graphs
by: Bar-Noy, Amotz, et al.
Published: (2025)

On the Complexity of Distance-$d$ Independent Set Reconfiguration
by: Hoang, Duc A.
Published: (2022)

Unbent Collections of Orthogonal Drawings
by: Antić, Todor, et al.
Published: (2025)

An Algorithm to Recover Shredded Random Matrices
by: Atamanchuk, Caelan, et al.
Published: (2023)

A New Temporal Interpretation of Cluster Editing
by: Bocci, Cristiano, et al.
Published: (2022)

Cops and robbers pebbling in graphs
by: Clarke, Nancy, et al.
Published: (2023)

On the joint embedding property for cographs and trees
by: Carter, Daniel
Published: (2024)

A tame vs. feral dichotomy for graph classes excluding an induced minor or induced topological minor
by: Milanič, Martin, et al.
Published: (2024)

The Upper Clique Transversal Problem
by: Milanič, Martin, et al.
Published: (2023)

Pathographs and some (un)decidability results
by: Carter, Daniel, et al.
Published: (2025)

Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem
by: Boros, Endre, et al.
Published: (2023)

m-Eternal Domination and Variants on Some Classes of Finite and Infinite Graphs
by: Calamoneri, Tiziana, et al.
Published: (2025)

Lower Bounds for the Pfaffian Number of Graphs
by: Junchaya, Enrique, et al.
Published: (2026)

The Hierarchy of Hereditary Sorting Operators
by: Jelínek, Vít, et al.
Published: (2023)

The Minimum Eternal Vertex Cover Problem on a Subclass of Series-Parallel Graphs
by: Calamoneri, Tiziana, et al.
Published: (2025)

Obstructions to return preservation for episturmian morphisms
by: Berthé, Valérie, et al.
Published: (2024)

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

Totally $Δ$-Modular Tree Decompositions of Graphic Matrices for Integer Programming
by: McFarland, Caleb
Published: (2026)

Directed branch-width: A directed analogue of tree-width
by: Bumpus, Benjamin Merlin, et al.
Published: (2020)

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

Branch-width of represented matroids in matrix multiplication time
by: Choi, Mujin, et al.
Published: (2026)

BFS versus DFS for random targets in ordered trees
by: Dimitrov, Stoyan, et al.
Published: (2024)

Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
by: Chimani, Markus, et al.
Published: (2021)

Temporal Triadic Closure: Finding Dense Structures in Social Networks That Evolve
by: Davot, Tom, et al.
Published: (2024)

Directed Capacity-Preserving Subgraphs: Hardness and Exact Polynomial Algorithms
by: Chimani, Markus, et al.
Published: (2023)

A note on the structure of locally finite planar quasi-transitive graphs
by: Giocanti, Ugo
Published: (2024)