Chasing robbers on percolated random geometric graphs

MaRDI QIDQ2941401zbMATH OpenFDO

Authors Anshui Li, Tobias Müller, Paweł Prałat

Publication date 28 August 2015

zbMATH Keywords

cops and robbersrandom graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

Recommendations

• Chasing robbers on random geometric graphs-an alternative approach
• Cops and robbers on geometric graphs
• Chasing robbers on random graphs: zigzag theorem
• When does a random graph have constant cop number?
• Cops and robbers in a random graph

Cited in

(6)

• Vertex Pursuit Games in Stochastic Network Models
• Chasing robbers on random graphs: zigzag theorem
• Pursuit-evasion in models of complex networks
• Chasing robbers on random geometric graphs-an alternative approach
• Cops and robbers on geometric graphs
• When does a random graph have constant cop number?

This page was built for publication: Chasing robbers on percolated random geometric graphs

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