On the public citation graph

�ber trennende Eckenmengen in Graphen und den Mengerschen Satz

https://doi.org/10.1007/bf01362665
0 signed · 34 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/bf01343731openalex-snapshot
�ber Minimalstrukturen von Graphen, insbesondere vonn-fach zusammenh�ngenden Graphen
inferredcites →https://doi.org/10.1007/bf01792729openalex-snapshot
Theorie der endlichen und unendlichen Graphen
inferredcites →https://doi.org/10.1090/coll/038openalex-snapshot
Theory of Graphs
inferredcites →https://doi.org/10.1112/jlms/s1-13.3.188openalex-snapshot
Ein Neuer Beweis Eines Mengerschen Satzes
inferredcites →https://doi.org/10.1112/jlms/s1-38.1.148openalex-snapshot
Extensions of Menger's Theorem†
inferredcites →https://doi.org/10.4064/fm-10-1-96-115openalex-snapshot
Zur allgemeinen Kurventheorie

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.3190080311openalex-snapshot
A simple proof of Menger's theorem
inferred← citeshttps://doi.org/10.1002/mana.19650280508openalex-snapshot
Einige Bemerkungen über unendliche Graphen
inferred← citeshttps://doi.org/10.1002/mana.19650300106openalex-snapshot
Über die Maximalzahl fremder unendlicher Wege in Graphen
inferred← citeshttps://doi.org/10.1002/mana.19690400106openalex-snapshot
Extension of KÖNIG's Lemma
inferred← citeshttps://doi.org/10.1002/mana.19811010120openalex-snapshot
Über maximale Systeme von kantendisjunkten unendlichen Wegen in Graphen
inferred← citeshttps://doi.org/10.1002/mana.201800055openalex-snapshot
On tree‐decompositions of one‐ended graphs
inferred← citeshttps://doi.org/10.1007/978-94-009-0517-7_13openalex-snapshot
On Infinite n-Connected Graphs
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/bf01350321openalex-snapshot
Untersuchungen �ber minimalen-fach zusammenh�ngende Graphen
inferred← citeshttps://doi.org/10.1007/bf01894783openalex-snapshot
A remark on Menger's theorem
inferred← citeshttps://doi.org/10.1007/bf02697874openalex-snapshot
A link between menger’s theorem and infinite euler graphs
inferred← citeshttps://doi.org/10.1007/bf02950646openalex-snapshot
Zur Struktur minimaln-fach zusammenhängender Graphen
inferred← citeshttps://doi.org/10.1007/bf02992931openalex-snapshot
Zur Theorie dern-fach zusammenhängenden Graphen
inferred← citeshttps://doi.org/10.1007/bf02996932openalex-snapshot
Schnittverbände in Graphen
inferred← citeshttps://doi.org/10.1007/s11229-023-04310-3openalex-snapshot
How to frame innovation in mathematics
inferred← citeshttps://doi.org/10.1016/0012-365x(78)90181-4openalex-snapshot
On a problem of R. Halin concerning infinite graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(80)90149-1openalex-snapshot
On a problem of R. Halin concerning infinite graphs II
inferred← citeshttps://doi.org/10.1016/0012-365x(83)90094-8openalex-snapshot
On Halin-lattices in graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(79)90082-0openalex-snapshot
Über eine eigenschaft lokalfiniter, unendlicher bäume
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.06.043openalex-snapshot
On a new reformulation of Hadwiger's conjecture
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00033-8openalex-snapshot
On the connectivity of infinite graphs and 2-complexes
inferred← citeshttps://doi.org/10.1016/s0021-9800(67)80077-2openalex-snapshot
Infinite graphs—A survey
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.1016/s0195-6698(85)80036-6openalex-snapshot
On Maps Related to Halin Separation Lattices
inferred← citeshttps://doi.org/10.4115/jla.v6i0.231openalex-snapshot
10.4115/jla.v6i0.231
inferred← citeshttps://doi.org/10.4467/20842589rm.22.003.16660openalex-snapshot
A formal approach to Menger's theorem
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.