On the public citation graph

Some path problems in Graph theory

https://doi.org/10.1007/bf02992956
0 signed · 19 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.19650280508openalex-snapshot
Einige Bemerkungen über unendliche Graphen
inferredcites →https://doi.org/10.1002/mana.19650300106openalex-snapshot
Über die Maximalzahl fremder unendlicher Wege in Graphen
inferredcites →https://doi.org/10.1002/mana.19660310110openalex-snapshot
Graphen ohne unendliche Wege
inferredcites →https://doi.org/10.1002/mana.19680360509openalex-snapshot
Wurzelbäume und Kantenorientierungen in Graphen
inferredcites →https://doi.org/10.1002/mana.19690410102openalex-snapshot
Wurzelbäume und unendliche Wege in Graphen
inferredcites →https://doi.org/10.1007/bf01220026openalex-snapshot
Charakterisierung der Graphen ohne unendliche Wege
inferredcites →https://doi.org/10.1090/coll/038openalex-snapshot
Theory of Graphs

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.23279openalex-snapshot
Counterexamples Regarding Linked and Lean Tree‐Decompositions of Infinite Graphs
inferred← citeshttps://doi.org/10.1002/net.3230120409openalex-snapshot
A matroid related to finitely chainlike, countably infinite networks
inferred← citeshttps://doi.org/10.1007/978-3-0348-5936-3_4openalex-snapshot
Systeme Disjunkter Unendlicher Wege in Graphen
inferred← citeshttps://doi.org/10.1007/bf02993015openalex-snapshot
Bemerkung zu einem Problem aus der Theorie der unendlichen Graphen
inferred← citeshttps://doi.org/10.1007/s12188-016-0161-2openalex-snapshot
Rudolf Halin: 1934–2014
inferred← citeshttps://doi.org/10.1016/0095-8956(78)90079-5openalex-snapshot
The limb analysis of countably infinite electrical networks
inferred← citeshttps://doi.org/10.1016/j.disc.2004.04.028openalex-snapshot
α -Extendable paths in infinite graphs
inferred← citeshttps://doi.org/10.1090/s0002-9947-1992-1066452-1openalex-snapshot
Transfinite Graphs and Electrical Networks
inferred← citeshttps://doi.org/10.1090/tran/1992-334-01openalex-snapshot
inferred← citeshttps://doi.org/10.1109/81.224295openalex-snapshot
Electrical isolation of a 0-section in a transfinite electrical network
inferred← citeshttps://doi.org/10.1109/cdc.1985.268775openalex-snapshot
Nonlinear infinite networks and related open problems
inferred← citeshttps://doi.org/10.1137/0510088openalex-snapshot
Countably Infinite Nonlinear Time-Varying Active Electrical 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.