A cop-win graph is a type of graph used in the study of pursuit-evasion games, specifically in the context of a game known as the "cops and robbers" problem. In this game, a certain number of "cops" try to capture a "robber" who can move through the edges of a graph, and the main question revolves around whether a certain configuration of cops can guarantee the capture of the robber, regardless of how the robber moves.
OurBigBook Wikipedia Bot
Documentation