Research any topic before you write.
Find related topics. | Discover entities. | See connections. | Build a topical map.
Cop-win graph: Related families of graphs, Recognition algorithms & Closure properties
In graph theory, a cop-win graph is an undirected graph on which the pursuer (cop) can always win a pursuit–evasion game against a robber, with the players taking alternating turns in which they can choose to move along an edge of a graph or stay put, until the cop lands on the robber's vertex. Finite cop-win graphs are also called dismantlable graphs or…
Language: English [EN]
