Guarding isometric subgraphs and cops and robber in planar graphs

DOI10.1016/J.EJC.2023.103809MaRDI QIDQ6563993zbMATH OpenFDO

Authors Sebastián González Hermosillo de la Maza, Bojan Mohar

Publication date 28 June 2024

Published in European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

1-guardable graphswide shadow in a subgraph

Mathematics Subject Classification ID

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)

Recommendations

• Guarding isometric subgraphs and lazy cops and robbers
• A game of cops and robbers
• Cops and Robbers on Planar‐Directed Graphs
• The cop number of the one-cop-moves game on planar graphs
• The one-cop-moves game on planar graphs

Cites work

• scientific article; zbMATH DE number 2117181 (Why is no real title available?)
• scientific article; zbMATH DE number 3214278 (Why is no real title available?)
• A game of cops and robbers
• Clique graphs and Helly graphs
• Lazy cops and robbers on hypercubes
• The cop number of the one-cop-moves game on planar graphs
• The game of cops and robbers on graphs
• The optimal capture time of the one-cop-moves game
• Topological directions in cops and robbers
• Variations of cops and robber on the hypercube
• Vertex-to-vertex pursuit in a graph

Cited in

(1)

• Guarding isometric subgraphs and lazy 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)