Highly connected non-2-linked digraphs
From MaRDI portal
Recommendations
Cited in
(31)- A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps.
- Lexicographic orientation algorithms
- Algorithms for finding a maximum non-\(k\)-linked graph
- Half-integral linkages in highly connected directed graphs
- Every (13k - 6)-strong tournament with minimum out-degree at least 28k - 13 is k-linked
- A minimum degree condition forcing a digraph to be k-linked
- Cycles through \(k\) vertices in bipartite tournaments
- On the structure of locally semicomplete digraphs
- Linkedness and Ordered Cycles in Digraphs
- Strong subgraph connectivity of digraphs
- Highly linked tournaments
- Disjoint paths in decomposable digraphs
- Finding a subdivision of a digraph
- Arc-disjoint directed and undirected cycles in digraphs
- A relaxation of the directed disjoint paths problem: a global congestion metric helps
- On the 2‐cyclic property in 2‐regular digraphs
- High connectivity keeping sets in graphs and digraphs
- \((2k+1)\)-connected tournaments with large minimum out-degree are \(k\)-linked
- Algorithms for finding a maximum non-\(k\)-linked graph
- On \(k\)-strong and \(k\)-cyclic digraphs
- Balanced branchings in digraphs
- On 1-factors with prescribed lengths in tournaments
- Highly linked tournaments with large minimum out-degree
- Cycle-connected mixed graphs and related problems
- Cycle-connected mixed graphs and related problems
- Degree conditions for \(H\)-linked digraphs
- Improved results on linkage problems
- Disjoint sub(di)graphs in digraphs
- scientific article; zbMATH DE number 3972885 (Why is no real title available?)
- An improved linear connectivity bound for tournaments to be highly linked
- Highly linked graphs
This page was built for publication: Highly connected non-2-linked digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1181017)
