On cop-win graphs

13 years 11 months ago

Following a question of Anstee and Farber we investigate the possibility that all bridged graphs are cop-win. We show that in

Gena Hahn, François Laviolette, Norbert Sau

DM 2002 | Interesting Questions | Inÿnite Chordal Graphs | Science B.V |

claim paper

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2002
Where	DM
Authors	Gena Hahn, François Laviolette, Norbert Sauer, Robert E. Woodrow

Comments (0)