On the public citation graph
Schnittverbände in Graphen
0 signed · 25 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/bf01362665openalex-snapshot
�ber trennende Eckenmengen in Graphen und den Mengerschen Satz
inferredcites →https://doi.org/10.1007/bf01792729openalex-snapshot
Theorie der endlichen und unendlichen Graphen
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.10011openalex-snapshot
Circuits through prescribed vertices in k‐connected k‐regular graphs
inferred← citeshttps://doi.org/10.1002/jgt.10018openalex-snapshot
On Vertices of outdegree n in minimally n‐connected digraphs
inferred← citeshttps://doi.org/10.1002/jgt.20411openalex-snapshot
Existence of openly disjoint circuits through a vertex
inferred← citeshttps://doi.org/10.1002/jgt.3190080311openalex-snapshot
A simple proof of Menger's theorem
inferred← citeshttps://doi.org/10.1007/3-540-46784-x_17openalex-snapshot
Generating All the Minimal Separators of a Graph
inferred← citeshttps://doi.org/10.1007/978-3-319-90104-6_3openalex-snapshot
On the Cooperative Graph Searching Problem
inferred← citeshttps://doi.org/10.1007/978-94-011-2080-7_10openalex-snapshot
Lattices Related to Separation in Graphs
inferred← citeshttps://doi.org/10.1007/bf01901751openalex-snapshot
Note über Kantenschnittverbände in Graphen
inferred← citeshttps://doi.org/10.1007/bf02950646openalex-snapshot
Zur Struktur minimaln-fach zusammenhängender Graphen
inferred← citeshttps://doi.org/10.1007/s00236-018-0329-6openalex-snapshot
Depletable channels: dynamics, behaviour, and efficiency in network design
inferred← citeshttps://doi.org/10.1007/s10851-024-01201-1openalex-snapshot
A Graph Multi-separator Problem for Image Segmentation
inferred← citeshttps://doi.org/10.1016/j.dam.2004.02.016openalex-snapshot
Representing a concept lattice by a graph
inferred← citeshttps://doi.org/10.1016/j.disc.2005.12.007openalex-snapshot
Listing all the minimal separators of a 3-connected planar graph
inferred← citeshttps://doi.org/10.1016/j.sysconle.2019.05.002openalex-snapshot
A dynamic graph characterisation of the fixed part of the controllable subspace of a linear structured system
inferred← citeshttps://doi.org/10.1016/s0095-8956(78)80012-4openalex-snapshot
Über n-fach zusammenhängende Eckenmengen in Graphen
inferred← citeshttps://doi.org/10.1016/s0195-6698(82)80006-1openalex-snapshot
On Primitive Sets in Graphs
inferred← citeshttps://doi.org/10.1016/s0195-6698(82)80028-0openalex-snapshot
On the Lattices of Cutsets in Finite Graphs
inferred← citeshttps://doi.org/10.1137/23m157065xopenalex-snapshot
Partial Reflections and Globally Linked Pairs in Rigid Graphs
inferred← citeshttps://doi.org/10.1142/s0129054100000211openalex-snapshot
GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
inferred← citeshttps://doi.org/10.4000/msh.2786openalex-snapshot
Orthotreillis et séparabilité dans un graphe non orienté
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.