String graph with cop number 4 (poster abstract)

DOI10.4230/LIPICS.GD.2024.53MaRDI QIDQ6920413zbMATH OpenFDO

Authors Stephane Durocher, Myroslav Kryven, Maarten Löffler

Publication date 7 October 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.GD.2024.53

zbMATH Keywords

dynamic programmingpoint set embeddingupward planar path embedding

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• A game of cops and robbers
• Cops and robbers on 1-planar graphs
• Cops and robbers on intersection graphs
• Intersection graphs of segments
• String graphs with precise number of intersections
• The game of cops and robbers on graphs
• Vertex-to-vertex pursuit in a graph

Cited in

(1)

• On the cop number of string graphs

This page was built for publication: String graph with cop number 4 (poster abstract)

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