Consequences of an algorithm for bridged graphs

DOI10.1016/j.disc.2002.05.001zbMath1041.05072OpenAlexW2145152756MaRDI QIDQ1827690

Jerry Spinrad, Van Bang Le

Publication date: 6 August 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2002.05.001

zbMATH Keywords

Cop-win graphsBridged graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Matrix multiplication via arithmetic progressions
• On local convexity in graphs
• On the null-homotopy of bridged graphs
• Bridged graphs and geodesic convexity
• On bridged graphs and cop-win graphs
• On diameters and radii of bridged graphs
• Bridged graphs are cop-win graphs: An algorithmic proof
• Conditions for invariance of set diameters under d-convexification in a graph
• Convexity in Graphs and Hypergraphs

This page was built for publication: Consequences of an algorithm for bridged graphs