Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs

DOI10.1137/23m1549912arXiv2301.13175MaRDI QIDQ6195949

Maria Chudnovsky, P. D. Seymour, Jérémie Turcotte, Serguei Norine

Publication date: 14 March 2024

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

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

zbMATH Keywords

cops and robberscop numberforbidden induced subgraph\(P_5\)-free graph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Ramsey-type theorems
• A game of cops and robbers
• Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time
• On a pursuit game played on graphs for which a minor is excluded
• On the cop number of a graph
• Vertex-to-vertex pursuit in a graph
• A note on cops and robbers, independence number, domination number and diameter
• Cops and robbers on graphs with a set of forbidden induced subgraphs
• Cops and robbers on \(2K_2\)-free graphs
• An application of the Gyárfás path argument
• Cops and robber on subclasses of \(P_5\)-free graphs
• On Moore Graphs with Diameters 2 and 3

This page was built for publication: Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs