On the public citation graph

On a property ofn-edge-connected digraphs

https://doi.org/10.1007/bf02579461
0 signed · 28 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01238648openalex-snapshot
Ecken vom Innen- und Au�engradn in minimaln-fach kantenzusammenh�ngenden Digraphen
inferredcites →https://doi.org/10.1016/0020-0190(79)90086-3openalex-snapshot
Edge-disjoint branching in directed multigraphs
inferredcites →https://doi.org/10.1016/s0195-6698(82)80009-7openalex-snapshot
Konstruktion aller n-fach kantenzusammenhängenden Digraphen

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.22046openalex-snapshot
Highly Connected Infinite Digraphs Without Edge‐Disjoint Back and Forth Paths Between a Certain Vertex Pair
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-29297-7_8openalex-snapshot
Network Flows
inferred← citeshttps://doi.org/10.1007/978-2-287-99037-3_8openalex-snapshot
Flots dans les réseaux
inferred← citeshttps://doi.org/10.1007/978-3-540-71844-4_8openalex-snapshot
Network Flows
inferred← citeshttps://doi.org/10.1007/978-3-540-76919-4_8openalex-snapshot
Netzwerkflüsse
inferred← citeshttps://doi.org/10.1007/978-3-642-24488-9_8openalex-snapshot
Network Flows
inferred← citeshttps://doi.org/10.1007/978-3-642-25401-7_8openalex-snapshot
Netzwerkflüsse
inferred← citeshttps://doi.org/10.1007/978-3-662-21708-5_8openalex-snapshot
Network Flows
inferred← citeshttps://doi.org/10.1007/978-3-662-21711-5_8openalex-snapshot
Network Flows
inferred← citeshttps://doi.org/10.1007/978-3-662-56039-6_8openalex-snapshot
Network Flows
inferred← citeshttps://doi.org/10.1007/978-3-662-57691-5_8openalex-snapshot
Netzwerkflüsse
inferred← citeshttps://doi.org/10.1007/978-88-470-1523-4_8openalex-snapshot
Reti di flusso
inferred← citeshttps://doi.org/10.1007/978-94-009-5315-4_26openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/bf02582931openalex-snapshot
Paths in graphs, reducing the edge-connectivity only by two
inferred← citeshttps://doi.org/10.1007/s10958-007-0332-xopenalex-snapshot
Cliques in k-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.cor.2011.05.019openalex-snapshot
An LP-based heuristic algorithm for the node capacitated in-tree packing problem
inferred← citeshttps://doi.org/10.1016/j.disc.2006.09.047openalex-snapshot
Removable edges in a 5-connected graph and a construction method of 5-connected graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00129-xopenalex-snapshot
Some generalizations of Menger's theorem concerning arc-connected digraphs
inferred← citeshttps://doi.org/10.1016/s0195-6698(82)80009-7openalex-snapshot
Konstruktion aller n-fach kantenzusammenhängenden Digraphen
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73419-4openalex-snapshot
On N–Edge–Connected Digraphs
inferred← citeshttps://doi.org/10.1109/mwscas.1991.252067openalex-snapshot
On disjoint paths of hypercubes
inferred← citeshttps://doi.org/10.15807/jorsj.54.219openalex-snapshot
LAGRANGIAN-BASED COLUMN GENERATION FOR THE NODE CAPACITATED IN-TREE PACKING PROBLEM( SCOPE (Seminar on Computation and OPtimization for new Extensions))
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.