Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4952410 | Theoretical Computer Science | 2016 | 11 Pages |
Abstract
In the locally finite case we characterise the constructible graphs as the graphs for which the cop has a so-called protective strategy and prove that the existence of such a strategy implies constructibility even for non-locally finite graphs.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Florian Lehner,