zbMATH — the first resource for mathematics

Vertex-to-vertex pursuit in a graph. (English) Zbl 0508.05058

05C99 Graph theory
05C10 Planar graphs; geometric and topological aspects of graph theory
91A24 Positional games (pursuit and evasion, etc.)
Full Text: DOI
[1] Kelly, D.; Rival, I., Crowns, fences and dismantlable lattices, Canad. J. math., 24, (1974) · Zbl 0271.06003
[2] Nowakowski, R.; Rival, I., The smallest graph variety containing all paths, Discrete math., 43, 223-234, (1983), in this issue. · Zbl 0511.05059
[3] Parsons, T.D., Pursuit-evasion in a graph, (), 426-441 · Zbl 0379.05026
[4] Smith, C.A.B., Graphs and composite games, J. combin. theory, 1, (1966) · Zbl 0141.36101
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.