Catching a Fast Robber on Interval Graphs

DOI10.1007/978-3-642-20877-5_35zbMath1332.91030OpenAlexW1590372461MaRDI QIDQ3010416

Tomáš Gavenčiak

Publication date: 1 July 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20877-5_35

zbMATH Keywords

interval graphcombinatorial gamepursuit gamecops and robber gameinterval graph representation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Combinatorial games (91A46) Graph representations (geometric and intersection representations, etc.) (05C62) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (2)

The fast robber on interval and chordal graphs ⋮ Cops, a fast robber and defensive domination on interval graphs

Cites Work

• A short note about pursuit games played on a graph with a given genus
• Vertex-to-vertex pursuit in a graph
• Pursuing a fast robber on a graph
• An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Catching a Fast Robber on Interval Graphs