On Meyniel's conjecture of the cop number
From MaRDI portal
Publication:2911063
DOI10.1002/jgt.20642zbMath1248.05121OpenAlexW1537525952WikidataQ123364882 ScholiaQ123364882MaRDI QIDQ2911063
Publication date: 12 September 2012
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20642
2-person games (91A05) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)
Related Items
To catch a falling robber, Variations on cops and robbers, Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond, The game of cops and robbers on directed graphs with forbidden subgraphs, A faster algorithm for cops and robbers, Catching a fast robber on the grid, Containment: a variation of cops and robber, Cops and robbers from a distance, Chasing a Fast Robber on Planar Graphs and Random Graphs, An Introduction to Lazy Cops and Robbers on Graphs, Cops and Robber game with a fast robber on expander graphs and random graphs, Cops and Robbers on Dynamic Graphs: Offline and Online Case, On the cop number of graphs of high girth, A tight lower bound for the capture time of the cops and robbers game, Cops and robber on subclasses of \(P_5\)-free graphs, The one-cop-moves game on graphs with some special structures, The fast robber on interval and chordal graphs, Cops and Robbers on diameter two graphs, Cops and Robbers on Graphs of Bounded Diameter, \(k\)-chordal graphs: from cops and robber to compact routing via treewidth, Fine-grained Lower Bounds on Cops and Robbers, Bounding the Cop Number of a Graph by Its Genus, The game of Cops and Robber on circulant graphs, A proof of the Meyniel conjecture for abelian Cayley graphs, Meyniel's conjecture holds for random graphs, 4-cop-win graphs have at least 19 vertices, Chasing robbers on random geometric graphs-an alternative approach, Cops and robbers on directed and undirected abelian Cayley graphs, Hyperopic cops and robbers, Conjectures on Cops and Robbers, Cops and Robbers on Graphs Based on Designs, The optimal capture time of the one-cop-moves game, Meyniel extremal families of abelian Cayley graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Cops and robbers from a distance
- A game of cops and robbers
- A short note about pursuit games played on a graph with a given genus
- Cops and robbers in graphs with large girth and Cayley graphs
- On a pursuit game played on graphs for which a minor is excluded
- On the cop number of a graph
- Variations on cops and robbers
- Chasing robbers on random graphs: Zigzag theorem
- A better bound for the cop number of general graphs
