Capture-time extremal cop-win graphs

DOI10.7151/dmgt.2224zbMath1468.05184arXiv1703.04427OpenAlexW2949845601WikidataQ127827712 ScholiaQ127827712MaRDI QIDQ2042606

Kerry Ojakian, David Offner

Publication date: 21 July 2021

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

extremal graphspursuit-evasion gamescops and robberscop-win graphscapture time

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Games involving graphs (91A43) Structural characterization of families of graphs (05C75) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Related Items

Chasing a drunk robber in many classes of graphs

Cites Work

• Unnamed Item
• Bounds on the length of a game of cops and robbers
• Cop-win graphs with maximum capture-time
• The capture time of a graph
• Vertex-to-vertex pursuit in a graph
• A simple method of computing the catch time