On the public citation graph

Aspects topologiques de la s�paration dans les graphes infinis. I

https://doi.org/10.1007/bf01175130
0 signed · 30 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.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.1007/bf01362670openalex-snapshot
�ber unendliche Wege in Graphen
inferredcites →https://doi.org/10.1007/bf02993589openalex-snapshot
A note on Menger's theorem for infinite locally finite 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.23234openalex-snapshot
Edge‐Connectivity Between Edge‐Ends of Infinite Graphs
inferred← citeshttps://doi.org/10.1002/mana.19821070124openalex-snapshot
Développements terminaux des graphes infinis I. Arbres maximaux coterminaux
inferred← citeshttps://doi.org/10.1002/mana.19841150126openalex-snapshot
Développments terminaux des graphes infinis III. Arbres maximaux sans rayon, cardinalité maximum des ensembles disjoints de rayons
inferred← citeshttps://doi.org/10.1006/jctb.1996.0057openalex-snapshot
Ends and Multi-endings, II
inferred← citeshttps://doi.org/10.1007/978-1-4899-2323-3_21openalex-snapshot
Trees, Ends, and Transience
inferred← citeshttps://doi.org/10.1007/978-94-009-0517-7_15openalex-snapshot
Ends of Infinite Graphs, Potential Theory and Electrical 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/bf01182468openalex-snapshot
Aspects topologiques de la s�paration dans les graphes infinis. II
inferred← citeshttps://doi.org/10.1007/bf02925134openalex-snapshot
Harmonic functions on infinite graphs
inferred← citeshttps://doi.org/10.1007/s00493-008-2342-9openalex-snapshot
Graph-like continua, augmenting arcs, and Menger’s theorem
inferred← citeshttps://doi.org/10.1016/0012-365x(82)90292-8openalex-snapshot
Sous-graphes traçables des graphes infinis
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90166-fopenalex-snapshot
On the existence of minimal end-separators
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90333-wopenalex-snapshot
Some results on ends and automorphisms of graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(92)00525-vopenalex-snapshot
Minimax theorems for infinite graphs with the ends as ideal points
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90039-iopenalex-snapshot
A minimax theorem for infinite graphs with ideal points
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00151-lopenalex-snapshot
Invariant Hamming graphs in infinite quasi-median graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(89)90034-8openalex-snapshot
Graphs and groups with tree-like properties
inferred← citeshttps://doi.org/10.1016/0095-8956(91)90040-qopenalex-snapshot
A mengerian theorem for infinite graphs with ideal points
inferred← citeshttps://doi.org/10.1016/0095-8956(92)90059-7openalex-snapshot
Infinite connected graphs with no end-preserving spanning trees
inferred← citeshttps://doi.org/10.1016/j.disc.2004.04.028openalex-snapshot
α -Extendable paths in infinite graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00042-9openalex-snapshot
Spanning trees of countable graphs omitting sets of dominated ends
inferred← citeshttps://doi.org/10.1016/s0195-6698(83)80032-8openalex-snapshot
Sur une Extension du Théorème de Menger aux Graphes Infinis
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72823-8openalex-snapshot
On Automorphisms of Graphs with Forbidden Subgraphs
inferred← citeshttps://doi.org/10.1023/a:1004371421758openalex-snapshot
Finite Invariant Sets for a Family of Endomorphisms in Compact Graphs
inferred← citeshttps://doi.org/10.1090/s0002-9947-1993-1102885-3openalex-snapshot
Martin and end compactifications for non-locally finite graphs
inferred← citeshttps://doi.org/10.1090/s0002-9947-99-02228-xopenalex-snapshot
Operating points in infinite nonlinear networks approximated by finite 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.