A note on \(k\)-cop-win graphs

DOI10.1016/j.disc.2017.10.009zbMath1380.05129OpenAlexW2768050560MaRDI QIDQ1699565

Seyyed Aliasghar Hosseini

Publication date: 23 February 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2017.10.009

zbMATH Keywords

connectivitycops and robbers\(k\)-cop-win graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Vertex degrees (05C07) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (1)

4-cop-win graphs have at least 19 vertices

Cites Work

• Unnamed Item
• On the minimum order of k-cop-win graphs
• Conjectures on Cops and Robbers

This page was built for publication: A note on \(k\)-cop-win graphs