Pages that link to "Item:Q1827690"
From MaRDI portal
The following pages link to Consequences of an algorithm for bridged graphs (Q1827690):
Displaying 5 items.
- Efficient systolic algorithm for finding bridges in a connected graph (Q1099959) (← links)
- On bridged graphs and cop-win graphs (Q1108291) (← links)
- Bridged graphs are cop-win graphs: An algorithmic proof (Q1354123) (← links)
- A simple systolic method to find all bridges of an undirected graph (Q1823709) (← links)
- On dually compact closed classes of graphs and BFS-constructible graphs (Q4823313) (← links)