On bridged graphs and cop-win graphs

DOI10.1016/0095-8956(88)90093-7zbMath0654.05049OpenAlexW2987990768MaRDI QIDQ1108291

Martin Farber, Richard P. Anstee

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0095-8956(88)90093-7

zbMATH Keywords

chordal graphssimplicial vertexbridged graphscop-win graphsuniversal vertexisometric subgraphgeodesically convex set in graphmodular graphs

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (30)

The contour of a bridged graph is geodetic ⋮ A Helly theorem for geodesic convexity in strongly dismantlable graphs ⋮ Fast Robber in Planar Graphs ⋮ Applying clique-decomposition for computing Gromov hyperbolicity ⋮ On diameters and radii of bridged graphs ⋮ 3-colouring for dually chordal graphs and generalisations ⋮ Cops and robbers from a distance ⋮ A Helly theorem in weakly modular space ⋮ Bucolic complexes ⋮ A hierarchy of dismantlings in graphs ⋮ The node cop‐win reliability of unicyclic and bicyclic graphs ⋮ Quadric complexes ⋮ Graphs with convex balls ⋮ First-order logic axiomatization of metric graph theory ⋮ A note on \(k\)-cop, \(l\)-robber games on graphs ⋮ Foldings in graphs and relations with simplicial complexes and posets ⋮ An annotated bibliography on guaranteed graph searching ⋮ Graphs of some CAT(0) complexes ⋮ On geodesic structures of weakly median graphs. I. Decomposition and octahedral graphs ⋮ Large classes of infinite k-cop-win graphs ⋮ On covering bridged plane triangulations with balls ⋮ Consequences of an algorithm for bridged graphs ⋮ A two-person game on graphs where each player tries to encircle his opponent's men ⋮ Dismantlability of weakly systolic complexes and applications ⋮ Decomposition and \(l_1\)-embedding of weakly median graphs ⋮ Tandem-win graphs ⋮ A game of cops and robbers played on products of graphs ⋮ Distances in benzenoid systems: Further developments ⋮ Clique graphs and Helly graphs ⋮ Distance labeling schemes for \(K_4\)-free bridged graphs

Cites Work

• On local convexity in graphs
• On the null-homotopy of bridged graphs
• Bridged graphs and geodesic convexity
• Vertex-to-vertex pursuit in a graph
• Conditions for invariance of set diameters under d-convexification in a graph
• Convexity in Graphs and Hypergraphs

This page was built for publication: On bridged graphs and cop-win graphs