Improved bounds on the cop number when forbidding a minor
From MaRDI portal
Publication:6667593
DOI10.1002/JGT.23194MaRDI QIDQ6667593FDOQ6667593
Jérémie Turcotte, Erin Meger, Franklin Kenter
Publication date: 20 January 2025
Published in: Journal of Graph Theory (Search for Journal in Brave)
Games on graphs (graph-theoretic aspects) (05C57) Graph minors (05C83) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph minors. XX: Wagner's conjecture
- Cops and robbers in graphs with large girth and Cayley graphs
- Vertex-to-vertex pursuit in a graph
- Cops and robbers in a random graph
- Über eine Eigenschaft der ebenen Komplexe
- A game of cops and robbers
- Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
- On the cop number of toroidal graphs
- Linkless embeddings of graphs in 3-space
- A short note about pursuit games played on a graph with a given genus
- On a pursuit game played on graphs for which a minor is excluded
- The Cops and Robber game on graphs with forbidden (induced) subgraphs
- Topological directions in cops and robbers
- Cops and robbers on graphs with a set of forbidden induced subgraphs
- An application of the Gyárfás path argument
- Bounding the Cop Number of a Graph by Its Genus
- Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs
This page was built for publication: Improved bounds on the cop number when forbidding a minor
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6667593)
