On the public citation graph

Lattices of cuts in graphs

https://doi.org/10.1007/bf02950767
0 signed · 13 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/bf01362670openalex-snapshot
�ber unendliche Wege in Graphen
inferredcites →https://doi.org/10.1007/bf02996932openalex-snapshot
Schnittverbände in Graphen
inferredcites →https://doi.org/10.1515/9783112471401openalex-snapshot
Graphentheorie

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.21844openalex-snapshot
Vertex Cuts
inferred← citeshttps://doi.org/10.1002/mana.201800055openalex-snapshot
On tree‐decompositions of one‐ended graphs
inferred← citeshttps://doi.org/10.1007/3-540-46105-1_3openalex-snapshot
Maintaining Class Membership Information
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/s00493-018-3572-0openalex-snapshot
All Graphs Have Tree-Decompositions Displaying Their Topological Ends
inferred← citeshttps://doi.org/10.1016/j.datak.2004.02.001openalex-snapshot
Discovering patterns of medical practice in large administrative health databases
inferred← citeshttps://doi.org/10.1016/j.jctb.2021.08.004openalex-snapshot
Canonical trees of tree-decompositions
inferred← citeshttps://doi.org/10.1017/s0305004121000530openalex-snapshot
Trees of tangles in infinite separation systems
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00115openalex-snapshot
Canonical decompositions of 3-connected graphs
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.