On Meyniel's conjecture of the cop number
From MaRDI portal
Publication:2911063
DOI10.1002/JGT.20642zbMATH Open1248.05121OpenAlexW1537525952WikidataQ123364882 ScholiaQ123364882MaRDI QIDQ2911063FDOQ2911063
Authors: Linyuan Lu, Xing Peng 
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
Recommendations
- Meyniel's conjecture on the cop number: a survey
- On a conjecture of Meyniel
- On the Mesyan conjecture
- A corrected version of Meyniel's conjecture
- On the Breuil-Mézard conjecture
- On a Mouyart's conjecture
- scientific article; zbMATH DE number 1467435
- On Copson's theorem and its generalizations
- On the cop number of a graph
- scientific article; zbMATH DE number 3843791
2-person games (91A05) Games on graphs (graph-theoretic aspects) (05C57) Positional games (pursuit and evasion, etc.) (91A24)
Cites Work
- Cops and robbers in graphs with large girth and Cayley graphs
- On the cop number of a graph
- Variations on cops and robbers
- Chasing robbers on random graphs: zigzag theorem
- A game of cops and robbers
- Cops and robbers from a distance
- Searching and sweeping graphs: a brief survey
- Title not available (Why is that?)
- A short note about pursuit games played on a graph with a given genus
- On a pursuit game played on graphs for which a minor is excluded
- A better bound for the cop number of general graphs
Cited In (40)
- The one-cop-moves game on graphs with some special structures
- The game of cops and robbers on directed graphs with forbidden subgraphs
- The optimal capture time of the one-cop-moves game
- To catch a falling robber
- Meyniel extremal families of abelian Cayley graphs
- A tight lower bound for the capture time of the cops and robbers game
- Cops and robbers on graphs based on designs
- Cops and Robbers on Dynamic Graphs: Offline and Online Case
- A proof of the Meyniel conjecture for abelian Cayley graphs
- Cops and Robbers on Graphs of Bounded Diameter
- Fine-grained Lower Bounds on Cops and Robbers
- A better bound for the cop number of general graphs
- Hyperopic cops and robbers
- Meyniel's conjecture on graphs of bounded degree
- Catching a fast robber on the grid
- Chasing robbers on random geometric graphs-an alternative approach
- Bounding the cop number of a graph by its genus
- 4-cop-win graphs have at least 19 vertices
- Lower bounds for the capture time: linear, quadratic, and beyond
- Bounding the cop number of a graph by its genus
- Cops and robbers on directed and undirected abelian Cayley graphs
- The fast robber on interval and chordal graphs
- A faster algorithm for cops and robbers
- Chasing a fast robber on planar graphs and random graphs
- Meyniel's conjecture holds for random graphs
- Variations on cops and robbers
- Containment: a variation of cops and robber
- Cops and Robbers on diameter two graphs
- On the cop number of graphs of high girth
- Meyniel's conjecture on graphs with few P4's
- Cops and robbers from a distance
- An introduction to lazy cops and robbers on graphs
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth
- Conjectures on cops and robbers
- Meyniel's conjecture holds for random \(d\)-regular graphs
- Cops and robber on subclasses of \(P_5\)-free graphs
- On the minimum order of \(k\)-cop-win graphs
- Cops and Robber game with a fast robber on expander graphs and random graphs
- Meyniel's conjecture on the cop number: a survey
- The game of Cops and Robber on circulant graphs
This page was built for publication: On Meyniel's conjecture of the cop number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2911063)
