On the public citation graph
Paths in graphs, reducing the edge-connectivity only by two
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.1007/bf02579461openalex-snapshot
On a property ofn-edge-connected digraphs
inferredcites →https://doi.org/10.1016/0095-8956(84)90015-7openalex-snapshot
A sufficient condition for a graph to be weakly k-linked
inferredcites →https://doi.org/10.1016/s0167-5060(08)70504-1openalex-snapshot
A Reduction Method for Edge-Connectivity in 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.3190130110openalex-snapshot
Infinite, highly connected digraphs with no two arc‐disjoint spanning trees
inferred← citeshttps://doi.org/10.1002/jgt.3190190307openalex-snapshot
Paths, cycles, and arc‐connectivity in digraphs
inferred← citeshttps://doi.org/10.1007/3-540-52282-4_48openalex-snapshot
Nonblocking graphs: Greedy algorithms to compute disjoint paths
inferred← citeshttps://doi.org/10.1007/978-3-031-92935-9_20openalex-snapshot
Supereulerian Testing on Semi-Eulerian Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-46908-4_62openalex-snapshot
Cycles Containing Three Consecutive Edges in 2k-Edge-Connected Graphs
inferred← citeshttps://doi.org/10.1007/bf01787729openalex-snapshot
Every 4k-edge-connected graph is Weakly 3k-linked
inferred← citeshttps://doi.org/10.1007/bf01929484openalex-snapshot
2-reducible cycles containing three consecutive edges in (2k + 1)-edge-connected graphs
inferred← citeshttps://doi.org/10.1007/bf02349962openalex-snapshot
Counterexamples to a conjecture of mader about cycles through specified vertices inn-edge-connected graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90177-uopenalex-snapshot
Paths containing two adjacent edges in (2k+1)-edge-connected graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(88)90077-9openalex-snapshot
Paths in k-edge-connected graphs
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.disc.2010.05.023openalex-snapshot
Locally finite graphs with ends: A topological approach, I. Basic theory
inferred← citeshttps://doi.org/10.1016/j.disc.2010.05.027openalex-snapshot
Locally finite graphs with ends: A topological approach, II. Applications
inferred← citeshttps://doi.org/10.1016/j.disc.2010.12.018openalex-snapshot
Extremal infinite graph theory
inferred← citeshttps://doi.org/10.1016/j.disc.2011.02.007openalex-snapshot
Locally finite graphs with ends: A topological approach, III. Fundamental group and homology
inferred← citeshttps://doi.org/10.1109/mwscas.1991.252067openalex-snapshot
On disjoint paths of hypercubes
inferred← citeshttps://doi.org/10.1137/1.9781611975031.15openalex-snapshot
A submodular measure and approximate Gomory-Hu theorem for packing odd trails
inferred← citeshttps://doi.org/10.48550/arxiv.0912.4213openalex-snapshot
Locally finite graphs with ends: a topological approach
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.