Guarding isometric subgraphs and cops and robber in planar graphs
DOI10.1016/J.EJC.2023.103809zbMATH Open1542.05113MaRDI QIDQ6563993FDOQ6563993
Bojan Mohar, Sebastián González Hermosillo de la Maza
Publication date: 28 June 2024
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Planar graphs; geometric and topological aspects of graph theory (05C10) Games on graphs (graph-theoretic aspects) (05C57) 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?)
- Title not available (Why is that?)
- Vertex-to-vertex pursuit in a graph
- A game of cops and robbers
- Clique graphs and Helly graphs
- Variations of cops and robber on the hypercube
- Lazy Cops and Robbers on Hypercubes
- The optimal capture time of the one-cop-moves game
- The cop number of the one-cop-moves game on planar graphs
- Topological directions in cops and robbers
This page was built for publication: Guarding isometric subgraphs and cops and robber in planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6563993)
