Pages that link to "Item:Q1937358"

The following pages link to Meyniel's conjecture on the cop number: a survey (Q1937358):

Displaying 26 items.

• A probabilistic version of the game of zombies and survivors on graphs (Q343921) (← links)
• Cops and robbers ordinals of cop-win trees (Q512565) (← links)
• On a generalization of Meyniel's conjecture on the Cops and Robbers game (Q625381) (← links)
• On a characterization of evasion strategies for pursuit-evasion games on graphs (Q1686676) (← links)
• Visibility graphs, dismantlability, and the cops and robbers game (Q1693315) (← links)
• On the cop number of toroidal graphs (Q1984519) (← links)
• 4-cop-win graphs have at least 19 vertices (Q2032980) (← links)
• The game of cops and eternal robbers (Q2034413) (← links)
• Cops and robbers on directed and undirected abelian Cayley graphs (Q2048357) (← links)
• Meyniel extremal families of abelian Cayley graphs (Q2117525) (← links)
• A tight lower bound for the capture time of the cops and robbers game (Q2196569) (← links)
• Cops that surround a robber (Q2197471) (← links)
• A proof of the Meyniel conjecture for abelian Cayley graphs (Q2279260) (← links)
• Hyperopic cops and robbers (Q2328865) (← links)
• Topological directions in cops and robbers (Q2335907) (← links)
• Catching a fast robber on the grid (Q2401986) (← links)
• Cops and robber on subclasses of \(P_5\)-free graphs (Q2699919) (← links)
• Meyniel's conjecture holds for random graphs (Q2795750) (← links)
• On Meyniel's conjecture of the cop number (Q2911063) (← links)
• An Introduction to Lazy Cops and Robbers on Graphs (Q4581686) (← links)
• Meyniel's conjecture holds for random <b><i>d</i></b>‐regular graphs (Q4973643) (← links)
• Lazy Cops and Robbers on Hypercubes (Q5364259) (← links)
• A better bound for the cop number of general graphs (Q5387056) (← links)
• Conjectures on Cops and Robbers (Q5506774) (← links)
• Meyniel's conjecture on graphs of bounded degree (Q6080854) (← links)
• On the cop number of graphs of high girth (Q6093134) (← links)