Name
Abstract | ||
|---|---|---|
The cop-and-robber game is a game between two players, where one tries to catch the other by moving along the edges of a graph. It is well known that on a finite graph the cop has a winning strategy if and only if the graph is constructible and that finiteness is necessary for this result. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.tcs.2016.04.024 | Theoretical Computer Science |
Keywords | Field | DocType |
Pursuit evasion,Cops and robbers,Infinite graphs | Discrete mathematics,Modular decomposition,Indifference graph,Combinatorics,Forbidden graph characterization,Chordal graph,Graph product,Cograph,Pathwidth,Universal graph,Mathematics | Journal |
Volume | ISSN | Citations |
655 | 0304-3975 | 1 |
PageRank | References | Authors |
0.43 | 7 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Florian Lehner | 1 | 21 | 7.24 |