On the minimum order of k-cop-win graphs

zbMath1317.05118arXiv1308.2841MaRDI QIDQ5499961

Paolo Codenotti, Aaron Maurer, William Baird, Andrew Beveridge, John McCauley, Silviya Valeva, Anthony Bonato

Publication date: 5 August 2015

Full work available at URL: https://arxiv.org/abs/1308.2841

zbMATH Keywords

graphscops and robberscop numbervertex pursuit gamesMeyniel's conjecture

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57)

Related Items (9)

An Introduction to Lazy Cops and Robbers on Graphs ⋮ A note on \(k\)-cop-win graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the Conjecture of the Smallest 3-Cop-Win Planar Graph ⋮ Cops and robbers on \(2K_2\)-free graphs ⋮ 4-cop-win graphs have at least 19 vertices ⋮ Unnamed Item ⋮ Conjectures on Cops and Robbers

This page was built for publication: On the minimum order of k-cop-win graphs