Abstract

Following a question of Anstee and Farber we investigate the possibility that all bridged graphs are cop-win. We show that infinite chordal graphs, even of diameter two, need not be cop-win and point to some interesting questions, some of which we answer.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call