Bridged graphs are cop-win graphs: An algorithmic proof

DOI10.1006/jctb.1996.1726zbMath0873.05060OpenAlexW2014251725MaRDI QIDQ1354123

Victor Chepoi

Publication date: 26 October 1997

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/8b6d175e0433c90106649ce8cbe8d0e3ebb1e15b

zbMATH Keywords

gamebridged graphcop-win graphcop-win orderingbreadth-first-search

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38)

Related Items

The contour of a bridged graph is geodetic, The algebra of metric betweenness. I: Subdirect representation and retraction, A deterministic version of the game of zombies and survivors on graphs, Fast Robber in Planar Graphs, Collapsibility of CAT(0) spaces, Bucolic complexes, Characterizations of \(k\)-copwin graphs, Quadric complexes, Graphs with convex balls, First-order logic axiomatization of metric graph theory, Tree-like partial Hamming graphs, An annotated bibliography on guaranteed graph searching, Graphs of some CAT(0) complexes, On covering bridged plane triangulations with balls, Weakly Modular Graphs and Nonpositive Curvature, Consequences of an algorithm for bridged graphs, Dismantlability of weakly systolic complexes and applications, Decomposition and \(l_1\)-embedding of weakly median graphs, Tandem-win graphs, Distances in benzenoid systems: Further developments, Distance labeling schemes for \(K_4\)-free bridged graphs