Cops and robbers on multi-layer graphs

DOI10.1016/J.DAM.2026.01.017MaRDI QIDQ6842199zbMATH OpenFDO

Authors Jessica Enright, Kitty Meeks, William Pettersson, John Sylvester

Publication date 19 March 2026

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2026.01.017

zbMATH Keywords

cops and robbersMeyniel's conjecturemulti-layer graphspursuit-evasion games

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

Cites work

• A better bound for the cop number of general graphs
• A bound for the cops and robbers problem
• A cop and robber game on edge-periodic temporal graphs
• A faster algorithm for cops and robbers
• A game of cops and robbers
• A short note about pursuit games played on a graph with a given genus
• A taxonomy of multilayer network design and a survey of transportation and telecommunication applications
• Bounded size components -- partitions and transversals.
• Bounding the cop number of a graph by its genus
• Cops \& robber on periodic temporal graphs: characterization and improved bounds
• Cops and robbers in graphs with large girth and Cayley graphs
• Cops and robbers is EXPTIME-complete
• Cops and Robbers on Dynamic Graphs: Offline and Online Case
• Cops and Robbers on Multi-Layer Graphs
• Defective and clustered graph colouring
• Expander graphs and their applications
• Fine-grained Lower Bounds on Cops and Robbers
• Flip-width: cops and robber on dense graphs
• Graph searching and a min-max theorem for tree-width
• scientific article; zbMATH DE number 1665333 (Why is no real title available?)
• scientific article; zbMATH DE number 3625415 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• Lower bounds for the isoperimetric numbers of random regular graphs
• On Meyniel's conjecture of the cop number
• On the cop number and the weak Meyniel conjecture for algebraic graphs
• On the cop number of a graph
• On the cop number of graphs of high girth
• On the cop number of toroidal graphs
• Parameterized algorithms
• Probability and Computing
• Pursuit-evasion in models of complex networks
• Random graphs.
• The cops and robber game on graphs with forbidden (induced) subgraphs
• The effect of faults on network expansion
• The game of cops and robbers on graphs
• The Mathematical Coloring Book
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Variations on cops and robbers
• Vertex-to-vertex pursuit in a graph

Cited in

(1)

• Capturing an invisible robber using separators

This page was built for publication: Cops and robbers on multi-layer graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842199)