Characterizations of -copwin graphs
Authors:
- Nancy E. ClarkeNCNancy E. Clarke
- Gary MacGillivrayGMGary MacGillivray
- 1 April 2012
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 312 (8) , 1421-1425
Abstract
No abstract availableKeywords
Funding Information
- Natural Sciences and Engineering Research Council of Canada
This publication has 9 references indexed in Scilit:
- Cops and Robbers from a distanceTheoretical Computer Science, 2010
- A note on -cop, -robber games on graphsDiscrete Mathematics, 2006
- Tandem-win graphsDiscrete Mathematics, 2005
- A Tandem version of the Cops and Robber Game played on products of graphsDiscussiones Mathematicae Graph Theory, 2005
- On Distance-Preserving and Domination Elimination OrderingsSIAM Journal on Discrete Mathematics, 1998
- Bridged Graphs Are Cop-Win Graphs: An Algorithmic ProofJournal of Combinatorial Theory, Series B, 1997
- On the Cop Number of a GraphAdvances in Applied Mathematics, 1993
- A game of cops and robbersDiscrete Applied Mathematics, 1984
- Vertex-to-vertex pursuit in a graphDiscrete Mathematics, 1983