On the Conjecture of the Smallest 3-Cop-Win Planar Graph

DOI10.1007/978-3-319-55911-7_36zbMath1462.05255OpenAlexW2602076019MaRDI QIDQ2988846

Photchchara Pisantechakool, Xue-Hou Tan

Publication date: 19 May 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-55911-7_36

zbMATH Keywords

cop numbercops and robbers gamecapture strategywinning vertices

Mathematics Subject Classification ID

Games involving graphs (91A43) Planar graphs; geometric and topological aspects of graph theory (05C10) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (2)

Cops and robbers on \(2K_2\)-free graphs ⋮ 4-cop-win graphs have at least 19 vertices

Cites Work

• Unnamed Item
• Unnamed Item
• A game of cops and robbers
• Vertex-to-vertex pursuit in a graph
• On the Capture Time of Cops and Robbers Game on a Planar Graph
• On the minimum order of k-cop-win graphs

This page was built for publication: On the Conjecture of the Smallest 3-Cop-Win Planar Graph