Cops and robber on subclasses of \(P_5\)-free graphs

DOI10.1016/j.disc.2023.113353OpenAlexW3213717133MaRDI QIDQ2699919

Uttam K. Gupta, Suchismita Mishra, Dinabandhu Pradhan

Publication date: 20 April 2023

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

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

zbMATH Keywords

forbidden induced subgraphscop number\(P_5\)-free graphscops and robber

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

• Characterizations of \(k\)-copwin graphs
• Cops and Robbers on diameter two graphs
• \(k\)-chordal graphs: from cops and robber to compact routing via treewidth
• A game of cops and robbers
• Note on a pursuit game played on graphs
• Cops and robbers in graphs with large girth and Cayley graphs
• On the cop number of a graph
• Vertex-to-vertex pursuit in a graph
• Meyniel's conjecture on the cop number: a survey
• Cops and robbers on graphs with a set of forbidden induced subgraphs
• Cops and robbers on \(2K_2\)-free graphs
• Pursuing a fast robber on a graph
• An application of the Gyárfás path argument
• On Meyniel's conjecture of the cop number
• A Bound for the Cops and Robbers Problem
• The Cops and Robber game on graphs with forbidden (induced) subgraphs