On the public citation graph

Bemerkung zu einem Problem aus der Theorie der unendlichen Graphen

https://doi.org/10.1007/bf02993015
0 signed · 16 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.1002/mana.19650300106openalex-snapshot
Über die Maximalzahl fremder unendlicher Wege in Graphen
inferredcites →https://doi.org/10.1002/mana.19700440109openalex-snapshot
Die Maximalzahl fremder zweiseitig unendlicher Wege in Graphen
inferredcites →https://doi.org/10.1007/bf02992956openalex-snapshot
Some path problems in Graph theory
inferredcites →https://doi.org/10.1007/bf02995937openalex-snapshot
A problem in infinite graph-theory

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.10016openalex-snapshot
On disjoint configurations in infinite graphs
inferred← citeshttps://doi.org/10.1002/mana.19811010120openalex-snapshot
Über maximale Systeme von kantendisjunkten unendlichen Wegen in Graphen
inferred← citeshttps://doi.org/10.1007/bf03322752openalex-snapshot
On the Immersion Relation and an Embedding Problem for Infinite Graphs
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/0095-8956(76)90052-6openalex-snapshot
A note on a problem of Halin's
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.ejc.2021.103326openalex-snapshot
Ubiquity and the Farey graph
inferred← citeshttps://doi.org/10.1016/j.jctb.2012.11.003openalex-snapshot
Classes of locally finite ubiquitous graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.05.011openalex-snapshot
Topological ubiquity of trees
inferred← citeshttps://doi.org/10.48550/arxiv.1806.04008openalex-snapshot
Ubiquity in graphs I: Topological ubiquity of trees
inferred← citeshttps://doi.org/10.48550/arxiv.2012.13070openalex-snapshot
Ubiquity in graphs III: Ubiquity of locally finite graphs with extensive tree-decompositions
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.