Meyniel’s conjecture on the cop number: A survey

2012/01/01 by William Baird, Anthony Bonato · 1 citation
Mathematics · Computer Science · #Graph theory and applications #Graph Labeling and Dimension Problems #Advanced Graph Theory Research

paper · pdf · doi:10.4310/joc.2012.v3.n2.a6

openalex publication_date 2012/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/06/26

Abstract

Meyniel's conjecture is one of the deepest open problems on the cop number of a graph. It states that for a connected graph

Citations

• Vertex-to-vertex pursuit in a graph
• A new bound for the cops and robbers problem

Cited by

• List of unsolved problems in mathematics [wikipedia]