Almost all cop-win graphs contain a universal vertex
From MaRDI portal
Publication:418869
DOI10.1016/j.disc.2012.02.018zbMath1242.05178OpenAlexW2079449107MaRDI QIDQ418869
Anthony Bonato, Paweł Prałat, Graeme Kemkes
Publication date: 30 May 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2012.02.018
Related Items
Cops and Robbers on Geometric Graphs, Almost all \(k\)-cop-win graphs contain a dominating set of cardinality \(k\), The role of quantum correlations in cop and robber game
Cites Work
- Characterizations of \(k\)-copwin graphs
- A game of cops and robbers
- An annotated bibliography on guaranteed graph searching
- Vertex-to-vertex pursuit in a graph
- Cops and robbers in a random graph
- Meyniel's conjecture holds for random graphs
- Chasing robbers on random graphs: Zigzag theorem
- Pursuit-Evasion in Models of Complex Networks
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item