Most Generalized Petersen graphs of girth 8 have cop number 4

zbMath1493.05209arXiv2009.00693MaRDI QIDQ5090526

Tigana Runte, Adrian Skelton, Joy Morris

Publication date: 20 July 2022

Full work available at URL: https://arxiv.org/abs/2009.00693

zbMATH Keywords

cops and robberweak cop number

Mathematics Subject Classification ID

Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• A game of cops and robbers
• The role of information in the cop-robber game
• The isomorphism classes of the generalized Petersen graphs
• Cops and robbers in graphs with large girth and Cayley graphs
• Vertex-to-vertex pursuit in a graph
• Cops that surround a robber
• On the cop number of generalized Petersen graphs
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• On generalised Petersen graphs of girth 7 that have cop number 4
• Conjectures on Cops and Robbers
• I-graphs and the corresponding configurations
• Unnamed Item
• Unnamed Item

This page was built for publication: Most Generalized Petersen graphs of girth 8 have cop number 4