Pages that link to "Item:Q1108291"
From MaRDI portal
The following pages link to On bridged graphs and cop-win graphs (Q1108291):
Displayed 16 items.
- Clique graphs and Helly graphs (Q802632) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- On diameters and radii of bridged graphs (Q1117245) (← links)
- A Helly theorem in weakly modular space (Q1126279) (← links)
- A two-person game on graphs where each player tries to encircle his opponent's men (Q1285593) (← links)
- Decomposition and \(l_1\)-embedding of weakly median graphs (Q1582477) (← links)
- A game of cops and robbers played on products of graphs (Q1584265) (← links)
- Distances in benzenoid systems: Further developments (Q1584454) (← links)
- Consequences of an algorithm for bridged graphs (Q1827690) (← links)
- A Helly theorem for geodesic convexity in strongly dismantlable graphs (Q1893169) (← links)
- Graphs of some CAT(0) complexes (Q1973869) (← links)
- A note on \(k\)-cop, \(l\)-robber games on graphs (Q2433710) (← links)
- On geodesic structures of weakly median graphs. I. Decomposition and octahedral graphs (Q2497466) (← links)
- Tandem-win graphs (Q2568474) (← links)
- On covering bridged plane triangulations with balls (Q4434549) (← links)
- Fast Robber in Planar Graphs (Q5302065) (← links)