Title of article
On cop-win graphs Original Research Article
Author/Authors
Ge?a Hahn، نويسنده , , François Laviolette، نويسنده , , Norbert Sauer، نويسنده , , Robert E. Woodrow، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
15
From page
27
To page
41
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.
Journal title
Discrete Mathematics
Serial Year
2002
Journal title
Discrete Mathematics
Record number
949368
Link To Document