Cops and Robbers on String Graphs

DOI10.1007/978-3-662-48971-0_31MaRDI QIDQ3459875zbMATH OpenOpenAlexWikidataFDO

Authors Tomáš Gavenčiak, Przemysław Gordinowicz, Vít Jelínek, Pavel Klavík, Jan Kratochvíl

Publication date 11 January 2016

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-48971-0_31

zbMATH Keywords

cops and robbersgames on graphsinterval filament graphspursuit gamesstring graphs

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Positional games (pursuit and evasion, etc.) (91A24) Games involving graphs (91A43)

Recommendations

• Cops and robbers on oriented graphs
• Cops and Robbers on Planar‐Directed Graphs
• Cops and robbers on geometric graphs
• Cops and Robbers on Graphs of Bounded Diameter
• Cops and robber on some families of oriented graphs
• Cops and robber on some families of oriented graphs
• Cops and Robbers on diameter two graphs
• Cops and robbers on graphs based on designs

Cited in

(1)

• A note on the cops and robber game on graphs embedded in non-orientable surfaces

This page was built for publication: Cops and Robbers on String Graphs

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