Pages that link to "Item:Q1354123"
From MaRDI portal
The following pages link to Bridged graphs are cop-win graphs: An algorithmic proof (Q1354123):
Displaying 21 items.
- The contour of a bridged graph is geodetic (Q266844) (← links)
- A deterministic version of the game of zombies and survivors on graphs (Q313777) (← links)
- Bucolic complexes (Q392957) (← links)
- Characterizations of \(k\)-copwin graphs (Q408176) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- Decomposition and \(l_1\)-embedding of weakly median graphs (Q1582477) (← links)
- Distances in benzenoid systems: Further developments (Q1584454) (← links)
- Consequences of an algorithm for bridged graphs (Q1827690) (← links)
- Graphs of some CAT(0) complexes (Q1973869) (← links)
- Distance labeling schemes for \(K_4\)-free bridged graphs (Q2105446) (← links)
- Collapsibility of CAT(0) spaces (Q2181578) (← links)
- Quadric complexes (Q2195008) (← links)
- The algebra of metric betweenness. I: Subdirect representation and retraction (Q2372427) (← links)
- Tree-like partial Hamming graphs (Q2442273) (← links)
- Tandem-win graphs (Q2568474) (← links)
- Weakly Modular Graphs and Nonpositive Curvature (Q3380549) (← links)
- On covering bridged plane triangulations with balls (Q4434549) (← links)
- Fast Robber in Planar Graphs (Q5302065) (← links)
- Dismantlability of weakly systolic complexes and applications (Q5496629) (← links)
- Graphs with convex balls (Q6163405) (← links)
- First-order logic axiomatization of metric graph theory (Q6196830) (← links)
