On the public citation graph
Unendliche minimalen-fach zusammenhängende Graphen
0 signed · 26 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.1002/mana.19650300106openalex-snapshot
Über die Maximalzahl fremder unendlicher Wege in Graphen
inferredcites →https://doi.org/10.1002/mana.19670330108openalex-snapshot
Ein Zerlegungssatz für unendliche Graphen und seine Anwendung auf Homomorphiebasen
inferredcites →https://doi.org/10.1007/bf01343731openalex-snapshot
�ber Minimalstrukturen von Graphen, insbesondere vonn-fach zusammenh�ngenden Graphen
inferredcites →https://doi.org/10.1007/bf01350321openalex-snapshot
Untersuchungen �ber minimalen-fach zusammenh�ngende Graphen
inferredcites →https://doi.org/10.1007/bf01350799openalex-snapshot
Kreise beschr�nkter L�nge in gewissen minimalenn-fach zusammenh�ngenden Graphen
inferredcites →https://doi.org/10.1007/bf02992473openalex-snapshot
Eckenn-ten Grades in minimalenn-fach zusammenhängenden Graphen
inferredcites →https://doi.org/10.1007/bf02992931openalex-snapshot
Zur Theorie dern-fach zusammenhängenden Graphen
inferredcites →https://doi.org/10.1016/s0021-9800(69)80049-9openalex-snapshot
A theorem on n-connected graphs
inferredcites →https://doi.org/10.1515/crll.1967.228.204openalex-snapshot
Minimally 2-connected graphs.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf01192782openalex-snapshot
Ein Ordnungsbegriff f�r Graphen ohne unendliche Wege mit einer Anwendung aufn-fach zusammenh�ngende Graphen
inferred← citeshttps://doi.org/10.1007/bf01304933openalex-snapshot
�ber minimaln-fach zusammenh�ngende, unendliche Graphen und ein Extremalproblem
inferred← citeshttps://doi.org/10.1007/s00026-020-00514-3openalex-snapshot
On Reconstruction of Normal Edge-Transitive Cayley Graphs
inferred← citeshttps://doi.org/10.1007/s12188-016-0173-yopenalex-snapshot
Critical vertices in k-connected digraphs
inferred← citeshttps://doi.org/10.1016/0095-8956(85)90076-0openalex-snapshot
Minimal n-fach zusammenhängende Digraphen
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.jctb.2008.08.008openalex-snapshot
A tight bound on the collection of edges in MSTs of induced subgraphs
inferred← citeshttps://doi.org/10.1017/s096354830000081xopenalex-snapshot
Minimization Problems for Infiniten-Connected Graphs
inferred← citeshttps://doi.org/10.1137/100783686openalex-snapshot
Ends and Vertices of Small Degree in Infinite Minimally k -(Edge)-Connected Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1703.08109openalex-snapshot
Cayley graphs and symmetric interconnection networks
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.