Bridged graphs are cop-win graphs: An algorithmic proof
From MaRDI portal
Recommendations
Cited in
(25)- Bucolic complexes
- Graphs with convex balls
- Distances in benzenoid systems: Further developments
- The contour of a bridged graph is geodetic
- Collapsibility of CAT(0) spaces
- Fast Robber in Planar Graphs
- Characterizations of k-copwin graphs
- On covering bridged plane triangulations with balls
- Dismantlability of weakly systolic complexes and applications
- An annotated bibliography on guaranteed graph searching
- A simple systolic method to find all bridges of an undirected graph
- Consequences of an algorithm for bridged graphs
- On bridged graphs and cop-win graphs
- Decomposition and \(l_1\)-embedding of weakly median graphs
- Quadric complexes
- The algebra of metric betweenness. I: Subdirect representation and retraction
- On cop-win graphs
- Graphs of some CAT(0) complexes
- A deterministic version of the game of zombies and survivors on graphs
- First-order logic axiomatization of metric graph theory
- Tandem-win graphs
- Weakly Modular Graphs and Nonpositive Curvature
- Tree-like partial Hamming graphs
- On constructible graphs, infinite bridged graphs and weakly cop-win graphs
- Distance labeling schemes for \(K_4\)-free bridged graphs
This page was built for publication: Bridged graphs are cop-win graphs: An algorithmic proof
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1354123)
