Highly connected non-2-linked digraphs
From MaRDI portal
Publication:1181017
DOI10.1007/BF01275674zbMath0746.05030OpenAlexW2012945739MaRDI QIDQ1181017
Publication date: 27 June 1992
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01275674
Related Items (28)
Every \((13k - 6)\)-strong tournament with minimum out-degree at least \(28k - 13\) is \(k\)-linked ⋮ Cycles through \(k\) vertices in bipartite tournaments ⋮ On \(k\)-strong and \(k\)-cyclic digraphs ⋮ Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments ⋮ On the 2‐cyclic property in 2‐regular digraphs ⋮ A minimum degree condition forcing a digraph to be k-linked ⋮ Improved results on linkage problems ⋮ Finding a subdivision of a digraph ⋮ Linkedness and Ordered Cycles in Digraphs ⋮ Highly linked tournaments ⋮ Degree Conditions for H-Linked Digraphs ⋮ An improved linear connectivity bound for tournaments to be highly linked ⋮ On the structure of locally semicomplete digraphs ⋮ Half-integral linkages in highly connected directed graphs ⋮ On 1-factors with prescribed lengths in tournaments ⋮ Cycle-connected mixed graphs and related problems ⋮ Cycle-connected mixed graphs and related problems ⋮ Strong subgraph connectivity of digraphs ⋮ A relaxation of the directed disjoint paths problem: a global congestion metric helps ⋮ A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps. ⋮ \((2k+1)\)-connected tournaments with large minimum out-degree are \(k\)-linked ⋮ Arc-Disjoint Directed and Undirected Cycles in Digraphs ⋮ Highly linked graphs ⋮ Lexicographic Orientation Algorithms ⋮ Disjoint sub(di)graphs in digraphs ⋮ Highly linked tournaments with large minimum out-degree ⋮ Balanced branchings in digraphs ⋮ Disjoint Paths in Decomposable Digraphs
Cites Work
This page was built for publication: Highly connected non-2-linked digraphs
