Nowakowski, Richard; Winkler, Peter Vertex-to-vertex pursuit in a graph. (English) Zbl 0508.05058 Discrete Math. 43, 235-239 (1983). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 13 ReviewsCited in 236 Documents MSC: 05C99 Graph theory 05C10 Planar graphs; geometric and topological aspects of graph theory 91A24 Positional games (pursuit and evasion, etc.) Keywords:winning strategy; reflexive graph; retract; positional game PDFBibTeX XMLCite \textit{R. Nowakowski} and \textit{P. Winkler}, Discrete Math. 43, 235--239 (1983; Zbl 0508.05058) Full Text: DOI References: [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, (Theory and Applications of Graphs. Theory and Applications of Graphs, Lecture Notes in Mathematics, 642 (1978), Springer-Verlag: Springer-Verlag Berlin), 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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.