A note on -cop, -robber games on graphs
Authors:
- Geňa HahnGHGeňa Hahn
- Gary MacGillivrayGMGary MacGillivray
- 1 October 2006
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 306 (19-20) , 2492-2497
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- On cop-win graphsDiscrete Mathematics, 2002
- The complexity of pursuit on a graphTheoretical Computer Science, 1995
- A Vertex-to-Vertex Pursuit Game Played With Disjoint Sets of Edges1993
- On bridged graphs and cop-win graphsJournal of Combinatorial Theory, Series B, 1988
- On a Pursuit Game on Cayley DigraphsEuropean Journal of Combinatorics, 1987
- On a pursuit game on cayley graphsCombinatorica, 1987
- Vertex-to-vertex pursuit in a graphDiscrete Mathematics, 1983