Small Connected Planar Graph with 1-Cop-Move Number 4
From MaRDI portal
Publication:6331134
arXiv1912.07004MaRDI QIDQ6331134
Author name not available (Why is that?)
Publication date: 15 December 2019
Abstract: This paper describes a 720-vertex connected planar graph G such that cop1(G), denoting the minimum number of cops needed to catch the robber in the 1-cop-move game on G, is at least 4 and at most 7. Furthermore, G has a connected subgraph H such that cop1(H) is exactly 4, meaning that 4 cops are barely sufficient to catch the robber in the 1-cop-move game on H. This is a significant improvement over the graph given by Gao and Yang in 2017.
No records found.
This page was built for publication: Small Connected Planar Graph with 1-Cop-Move Number 4
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6331134)