Pages that link to "Item:Q2300723"
From MaRDI portal
The following pages link to Making bidirected graphs strongly connected (Q2300723):
Displaying 6 items.
- On a relation between the domination number and a strongly connected bidirection of an undirected graph (Q1003464) (← links)
- Decomposition of a bidirected graph into strongly connected components and its signed poset structure (Q1923614) (← links)
- Sur le nombre minimum d'arcs à inverser pour rendre un graphe fortement connexe: Application à un problème de trafic (Q3222865) (← links)
- On the minimum number of arcs to reverse to make a graph strongly connected (Q3333064) (← links)
- New concept of connection in bidirected graphs (Q4553876) (← links)
- How to make a strongly connected digraph two-connected (Q5101433) (← links)