Pages that link to "Item:Q1066160"
From MaRDI portal
The following pages link to Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs) (Q1066160):
Displaying 9 items.
- Vertices of small degree in critically \(n\)-connected digraphs (Q1186137) (← links)
- Critical vertices in \(k\)-connected digraphs (Q1688272) (← links)
- On minimally \((n,\lambda)\)-connected graphs (Q1850492) (← links)
- Extremal results for directed tree connectivity (Q2117576) (← links)
- Approximating the smallest 2-vertex connected spanning subgraph of a directed graph (Q2286744) (← links)
- Small \(\ell\)-edge-covers in \(k\)-connected graphs (Q2446854) (← links)
- High connectivity keeping sets in graphs and digraphs (Q2575793) (← links)
- Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (Q2949211) (← links)
- Minimum 2-vertex strongly biconnected spanning directed subgraph problem (Q5051435) (← links)
