Consequences of an algorithm for bridged graphs

DOI10.1016/J.DISC.2002.05.001MaRDI QIDQ1827690zbMATH OpenOpenAlexFDO

Authors Van Bang Le, Jerry Spinrad

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)

Recommendations

• Bridged graphs are cop-win graphs: An algorithmic proof
• scientific article; zbMATH DE number 3896983
• On bridged graphs and cop-win graphs
• Bridged graphs and geodesic convexity
• Hyperbolic bridged graphs

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• Bridged graphs and geodesic convexity
• 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
• Matrix multiplication via arithmetic progressions
• On bridged graphs and cop-win graphs
• On diameters and radii of bridged graphs
• On local convexity in graphs
• On the null-homotopy of bridged graphs

Cited in

(4)

• Efficient systolic algorithm for finding bridges in a connected graph
• A simple systolic method to find all bridges of an undirected graph
• On bridged graphs and cop-win graphs
• On dually compact closed classes of graphs and BFS-constructible graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827690)