A better bound for the cop number of general graphs

DOI10.1002/jgt.20291zbMath1207.05138OpenAlexW4240838206MaRDI QIDQ5387056

Ehsan Chiniforooshan

Publication date: 14 May 2008

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20291

zbMATH Keywords

graphcaterpillarcops and robberscop numbersearch number

Mathematics Subject Classification ID

Games involving graphs (91A43) Signaling and communication in game theory (91A28) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (12)

Variations on cops and robbers ⋮ On Meyniel's conjecture of the cop number ⋮ Cops and robbers on intersection graphs ⋮ Cops and robbers from a distance ⋮ Cops and robber on butterflies, grids, and AT-free graphs ⋮ Pursuing a fast robber on a graph ⋮ Chasing robbers on random graphs: Zigzag theorem ⋮ Meyniel's conjecture holds for random graphs ⋮ Chasing robbers on random geometric graphs-an alternative approach ⋮ Guarding a subgraph as a tool in pursuit-evasion games ⋮ Conjectures on Cops and Robbers ⋮ The optimal capture time of the one-cop-moves game

This page was built for publication: A better bound for the cop number of general graphs