Autor:	Lim, Wei Quan
Rok vydání:	2019
Předmět:	Computer Science - Discrete Mathematics Mathematics - Combinatorics 05C57 (Primary) 91A43 (Secondary)
Druh dokumentu:	Working Paper
Popis:	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.
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1912.07004 Zobrazit plný text záznamu View this record from Arxiv