On the public citation graph
A sufficient condition for graphs to be weaklyk-linked
0 signed · 23 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.1002/mana.19790930116openalex-snapshot
Eine Reduktionsmethode für den Kantenzusammenhang in Graphen
inferredcites →https://doi.org/10.1007/bf01787729openalex-snapshot
Every 4k-edge-connected graph is Weakly 3k-linked
inferredcites →https://doi.org/10.1016/0095-8956(84)90069-8openalex-snapshot
Paths and edge-connectivity in graphs
inferredcites →https://doi.org/10.1016/0095-8956(88)90077-9openalex-snapshot
Paths in k-edge-connected graphs
inferredcites →https://doi.org/10.4099/math1924.10.99openalex-snapshot
Multicommodity flows in graphs II
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.3190160605openalex-snapshot
Edge‐disjoint paths and cycles in n‐edge‐connected graphs
inferred← citeshttps://doi.org/10.1002/net.3230220702openalex-snapshot
Networks communicating for each pairing of terminals
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/bf01271707openalex-snapshot
Three-regular path pairable graphs
inferred← citeshttps://doi.org/10.1007/s00373-016-1724-9openalex-snapshot
Liftings in Finite Graphs and Linkages in Infinite Graphs with Prescribed Edge-Connectivity
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/b978-044488002-4/50003-8openalex-snapshot
10.1016/b978-044488002-4/50003-8
inferred← citeshttps://doi.org/10.1016/j.dam.2017.10.026openalex-snapshot
Terminal-pairability in complete bipartite graphs
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.ipl.2018.05.001openalex-snapshot
Linkage on the infinite grid
inferred← citeshttps://doi.org/10.1137/110846725openalex-snapshot
Algorithms for Finding a Maximum Non- k -Linked Graph
inferred← citeshttps://doi.org/10.2201/niipi.2012.9.7openalex-snapshot
An immersion of a square in 4-edge-connected graphs
inferred← citeshttps://doi.org/10.7151/dmgt.2114openalex-snapshot
The path-pairability number of products of stars
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.