On the conjecture of the smallest 3-cop-win planar graph

DOI10.1007/978-3-319-55911-7_36MaRDI QIDQ2988846zbMATHzbMATHOpenAlexFDO

Authors Photchchara Pisantechakool, Xuehou 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

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

Recommendations

• A game of cops and robbers
• 4-cop-win graphs have at least 19 vertices
• Meyniel's conjecture on the cop number: a survey
• On the minimum order of \(k\)-cop-win graphs
• Cops and Robbers on Planar‐Directed Graphs

Cites work

• A game of cops and robbers
• On the Capture Time of Cops and Robbers Game on a Planar Graph
• On the minimum order of \(k\)-cop-win graphs
• Searching and sweeping graphs: a brief survey
• The game of cops and robbers on graphs
• Vertex-to-vertex pursuit in a graph

Cited in

(3)

• 4-cop-win graphs have at least 19 vertices
• Cops and robbers on \(2K_2\)-free graphs
• On the minimum order of 4-lazy cops-win graphs

This page was built for publication: On the conjecture of the smallest 3-cop-win planar graph

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