On the public citation graph
Highly connected non-2-linked digraphs
0 signed · 50 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0304-3975(80)90009-2openalex-snapshot
The directed subgraph homeomorphism problem
inferredcites →https://doi.org/10.1111/j.1749-6632.1989.tb22479.xopenalex-snapshot
Configurations in Graphs of Large Minimum Degree, Connectivity, or Chromatic Number
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.21775openalex-snapshot
Arc-Disjoint Paths in Decomposable Digraphs
inferred← citeshttps://doi.org/10.1002/jgt.22006openalex-snapshot
Arc‐Disjoint Directed and Undirected Cycles in Digraphs
inferred← citeshttps://doi.org/10.1002/jgt.22090openalex-snapshot
Disjoint Paths in Decomposable Digraphs
inferred← citeshttps://doi.org/10.1002/jgt.22157openalex-snapshot
Completing orientations of partially oriented graphs
inferred← citeshttps://doi.org/10.1002/rsa.3240060407openalex-snapshot
On the 2‐cyclic property in 2‐regular digraphs
inferred← citeshttps://doi.org/10.1006/eujc.1998.0231openalex-snapshot
Extremal Digraph Results for Topological Complete Subgraphs
inferred← citeshttps://doi.org/10.1007/978-3-030-92681-6_47openalex-snapshot
Cycle-Connected Mixed Graphs and Related Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-71840-8_12openalex-snapshot
Lexicographic Orientation Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_12openalex-snapshot
Algorithms for Finding a Maximum Non-k-linked Graph
inferred← citeshttps://doi.org/10.1007/978-88-7642-475-5_75openalex-snapshot
Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments
inferred← citeshttps://doi.org/10.1007/bf01215353openalex-snapshot
Cycles throughk vertices in bipartite tournaments
inferred← citeshttps://doi.org/10.1007/s00373-021-02294-wopenalex-snapshot
Strong Subgraph Connectivity of Digraphs
inferred← citeshttps://doi.org/10.1007/s00373-025-02970-1openalex-snapshot
A New Connectivity Bound for a Tournament to be Highly Linked
inferred← citeshttps://doi.org/10.1007/s00493-021-4374-3openalex-snapshot
(2K + 1)-Connected Tournaments with Large Minimum Out-Degree are K-Linked
inferred← citeshttps://doi.org/10.1007/s00493-021-4750-zopenalex-snapshot
Oriented Cycles in Digraphs of Large Outdegree
inferred← citeshttps://doi.org/10.1007/s10878-022-00979-3openalex-snapshot
Cycle-connected mixed graphs and related problems
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90645-vopenalex-snapshot
On the structure of locally semicomplete digraphs
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00300-lopenalex-snapshot
On k-strong and k-cyclic digraphs
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50002-6openalex-snapshot
10.1016/b978-044488002-4/50002-6
inferred← citeshttps://doi.org/10.1016/j.disc.2007.05.024openalex-snapshot
On low degree k-ordered graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2022.112831openalex-snapshot
Every (13k − 6)-strong tournament with minimum out-degree at least 28k − 13 is k-linked
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113351openalex-snapshot
Improved results on linkage problems
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114700openalex-snapshot
On the k-linkage problem for generalizations of semicomplete digraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114808openalex-snapshot
Constant congestion linkages in polynomially strong digraphs in polynomial time
inferred← citeshttps://doi.org/10.1016/j.ejc.2021.103390openalex-snapshot
An improved linear connectivity bound for tournaments to be highly linked
inferred← citeshttps://doi.org/10.1016/j.endm.2007.07.007openalex-snapshot
A minimum degree condition forcing a digraph to be k-linked
inferred← citeshttps://doi.org/10.1016/j.endm.2009.07.030openalex-snapshot
Disjoint sub(di)graphs in digraphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.02.009openalex-snapshot
Highly linked tournaments with large minimum out-degree
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.06.003openalex-snapshot
On 1-factors with prescribed lengths in tournaments
inferred← citeshttps://doi.org/10.1016/j.jctb.2025.10.005openalex-snapshot
Counterexamples to the linkage conjecture for tournaments
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.10.004openalex-snapshot
Finding a subdivision of a digraph
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.06.026openalex-snapshot
Balanced branchings in digraphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.10.023openalex-snapshot
A relaxation of the Directed Disjoint Paths problem: A global congestion metric helps
inferred← citeshttps://doi.org/10.1017/s0963548307008759openalex-snapshot
Linkedness and Ordered Cycles in Digraphs
inferred← citeshttps://doi.org/10.1017/s0963548313000278openalex-snapshot
Degree Conditions for H-Linked Digraphs
inferred← citeshttps://doi.org/10.1112/plms/pdu019openalex-snapshot
Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments
inferred← citeshttps://doi.org/10.1137/0405027openalex-snapshot
A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs
inferred← citeshttps://doi.org/10.1137/110846725openalex-snapshot
Algorithms for Finding a Maximum Non- k -Linked Graph
inferred← citeshttps://doi.org/10.1142/s0219265921420044openalex-snapshot
Strong Subgraph Connectivity of Digraphs: A Survey
inferred← citeshttps://doi.org/10.1145/3724120openalex-snapshot
New Menger-Like Dualities in Digraphs and Applications to Half-Integral Linkages
inferred← citeshttps://doi.org/10.17863/cam.32787openalex-snapshot
Extremal and Structural Problems of Graphs
inferred← citeshttps://doi.org/10.70675/28405a1bzc7e3z4648zabefzba13f7307f0fopenalex-snapshot
Substructures in digraphs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.