Pages that link to "Item:Q1108291"

The following pages link to On bridged graphs and cop-win graphs (Q1108291):

Displaying 32 items.

• The contour of a bridged graph is geodetic (Q266844) (← links)
• Bucolic complexes (Q392957) (← links)
• Foldings in graphs and relations with simplicial complexes and posets (Q442383) (← links)
• Cops and robbers from a distance (Q604465) (← links)
• 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)
• A note on \(k\)-cop-win graphs (Q1699565) (← 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)
• Distance labeling schemes for \(K_4\)-free bridged graphs (Q2105446) (← links)
• A hierarchy of dismantlings in graphs (Q2185916) (← links)
• Quadric complexes (Q2195008) (← links)
• Applying clique-decomposition for computing Gromov hyperbolicity (Q2399620) (← links)
• 3-colouring for dually chordal graphs and generalisations (Q2404614) (← 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)
• Large classes of infinite k-cop-win graphs (Q3061192) (← links)
• (Q3104264) (← 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)
• The node cop‐win reliability of unicyclic and bicyclic graphs (Q6065860) (← links)
• Graphs with convex balls (Q6163405) (← links)
• First-order logic axiomatization of metric graph theory (Q6196830) (← links)