Bridged graphs are cop-win graphs: An algorithmic proof

Journal of Combinatorial Theory. Series B

Volumn 69, Issue 1, 1997, Pages 97-100

  Chepoi, Victor ^a,b  

^a AIX MARSEILLE UNIVERSITY   (France)

^b UNIVERSITY OF HAMBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030637423     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.1996.1726     Document Type: Article

References (6)

1. 1. R. P. Anstee and M. Farber, On bridged graphs and cop-win graphs, J. Combin. Theory Ser. B 44 (1988), 22-28.
2. 2. M. Farber, Bridged graphs and geodesic convexity, Discrete Math. 66 (1987), 249-257.
3. 3. M. Farber and R. E. Jamison, On local convexity in graphs, Discrete Math. 66 (1987), 231-247.
4. 4. R. Nowakowski and P. Winkler, Vertex-to-vertex pursuit in a graph, Discrete Math. 43 (1983), 235-239.
5. 5. A. Quilliot, "Homomorphismes, points fixes, rétractions et jeux de poursuite dans les graphes, les ensembles ordonnés et les espaces métriques," Thèse d'État, Université de Paris VI, 1983.
6. 6. V. Soltan and V. Chepoi, Conditions for invariance of set diameters under d-convexification in a graph, Cybernetics 19 (1983), 750-756.