On the cop number of string graphs

DOI10.37236/13317MaRDI QIDQ6901255zbMATH OpenFDO

Authors Sandip Das, Harmender Gahlawat

Publication date 12 November 2025

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37236/13317

zbMATH Keywords

Cops and Robbersguarding technique

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

Cites work

• A faster algorithm for cops and robbers
• A game of cops and robbers
• A Separator Theorem for String Graphs and Its Applications
• A short note about pursuit games played on a graph with a given genus
• Bounding the cop number of a graph by its genus
• Coloring relatives of intervals on the plane. I: Chromatic number versus girth
• Cops and robber on butterflies, grids, and AT-free graphs
• Cops and robbers is EXPTIME-complete
• Cops and robbers on 1-planar graphs
• Cops and robbers on geometric graphs
• Cops and robbers on intersection graphs
• Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs
• Directed tree-width
• Fine-grained Lower Bounds on Cops and Robbers
• Fully active cops and robbers
• Graph Drawing
• Graph searching and a min-max theorem for tree-width
• Guarding isometric subgraphs and cops and robber in planar graphs
• scientific article; zbMATH DE number 1665333 (Why is no real title available?)
• scientific article; zbMATH DE number 3590298 (Why is no real title available?)
• LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth
• Marshals, monotone marshals, and hypertree-width
• On 1-planar graphs with bounded cop-number
• On a pursuit game played on graphs for which a minor is excluded
• On the computational complexity of a game of cops and robbers
• On the cop number of a graph
• On the cop number of string graphs
• On the cop number of toroidal graphs
• Optimality program in segment and string graphs
• Parameterized analysis of the Cops and Robber game
• Pursuing a fast robber on a graph
• String graph with cop number 4 (poster abstract)
• The cops and robber game on graphs with forbidden (induced) subgraphs
• The game of cops and robbers on graphs
• Triangle-free intersection graphs of line segments with large chromatic number
• Vertex Intersection Graphs of Paths on a Grid
• Vertex-to-vertex pursuit in a graph

Cited in

(1)

• Optimally reconnecting graphs against an edge-destroying adversary

This page was built for publication: On the cop number of string graphs

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