On the public citation graph
Charakterisierung der Graphen ohne unendliche Wege
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/bf01343731openalex-snapshot
�ber Minimalstrukturen von Graphen, insbesondere vonn-fach zusammenh�ngenden 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/1097-0118(200010)35:2<128::aid-jgt6>3.0.co;2-6openalex-snapshot
Miscellaneous problems on infinite graphs
inferred← citeshttps://doi.org/10.1002/jgt.22706openalex-snapshot
Duality theorems for stars and combs I: Arbitrary stars and combs
inferred← citeshttps://doi.org/10.1002/mana.19650300106openalex-snapshot
Über die Maximalzahl fremder unendlicher Wege in Graphen
inferred← citeshttps://doi.org/10.1002/mana.19660310110openalex-snapshot
Graphen ohne unendliche Wege
inferred← citeshttps://doi.org/10.1002/mana.19690410102openalex-snapshot
Wurzelbäume und unendliche Wege in Graphen
inferred← citeshttps://doi.org/10.1002/mana.19780820102openalex-snapshot
Interminable Paths and Trails: Extreme Cases
inferred← citeshttps://doi.org/10.1002/mana.19811010120openalex-snapshot
Über maximale Systeme von kantendisjunkten unendlichen Wegen in Graphen
inferred← citeshttps://doi.org/10.1007/978-1-4899-2323-3_20openalex-snapshot
Random Walks on ω-Networks
inferred← citeshttps://doi.org/10.1007/978-94-009-0517-7_16openalex-snapshot
Topological Aspects of Infinite Graphs
inferred← citeshttps://doi.org/10.1007/bf00276698openalex-snapshot
A maximum principle for node voltages in finitely structured, transfinite, electrical networks
inferred← citeshttps://doi.org/10.1007/bf01175130openalex-snapshot
Aspects topologiques de la s�paration dans les graphes infinis. I
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/bf02940917openalex-snapshot
A note on graphs with countable automorphism group
inferred← citeshttps://doi.org/10.1007/bf02992956openalex-snapshot
Some path problems in Graph theory
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/0095-8956(82)90006-5openalex-snapshot
Couplages et transversaux généralisés d'un hypergraphe infini
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70460-6openalex-snapshot
Some Problems and Results on Infinite Graphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70500-4openalex-snapshot
Simplicial Decompositions of Infinite Graphs
inferred← citeshttps://doi.org/10.1017/s096354830000081xopenalex-snapshot
Minimization Problems for Infiniten-Connected Graphs
inferred← citeshttps://doi.org/10.1090/s0002-9947-1993-1079058-6openalex-snapshot
Excluding Infinite Trees
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.