Catching a fast robber on interval graphs

DOI10.1007/978-3-642-20877-5_35MaRDI QIDQ3010416zbMATH OpenOpenAlexFDO

Authors 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

combinatorial gamecops and robber gameinterval graphinterval graph representationpursuit game

Mathematics Subject Classification ID

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

Recommendations

• The fast robber on interval and chordal graphs
• Cops, a fast robber and defensive domination on interval graphs
• Pursuing a fast robber on a graph
• Fast Robber in Planar Graphs
• Cops and Robber game without recharging

Cites work

• A short note about pursuit games played on a graph with a given genus
• An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
• scientific article; zbMATH DE number 5145315 (Why is no real title available?)
• scientific article; zbMATH DE number 4041287 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• Pursuing a fast robber on a graph
• Vertex-to-vertex pursuit in a graph

Cited in

(2)

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

This page was built for publication: Catching a fast robber on interval graphs

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