On the minimum order of 4-lazy cops-win graphs

MaRDI QIDQ4614817zbMATH OpenFDO

Authors Kai An Sim, Ta Sheng Tan, K. B. Wong

Publication date 31 January 2019

zbMATH Keywords

cops and robbersvertex-pursuit gamesminimum order

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

Recommendations

• On the minimum order of \(k\)-cop-win graphs
• 4-cop-win graphs have at least 19 vertices
• Lazy cops and robbers played on random graphs and graphs on surfaces
• Lazy Cops and Robbers on generalized hypercubes
• On the conjecture of the smallest 3-cop-win planar graph

Cites work

• A game of cops and robbers
• Cops and robbers from a distance
• On the minimum order of \(k\)-cop-win graphs
• Variations of cops and robber on the hypercube
• Vertex-to-vertex pursuit in a graph

Cited in

(1)

• On the minimum order of \(k\)-cop-win graphs

This page was built for publication: On the minimum order of 4-lazy cops-win graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4614817)