On the public citation graph
Ein Ordnungsbegriff f�r Graphen ohne unendliche Wege mit einer Anwendung aufn-fach zusammenh�ngende Graphen
0 signed · 29 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/bf01220026openalex-snapshot
Charakterisierung der Graphen ohne unendliche Wege
inferredcites →https://doi.org/10.1007/bf02995910openalex-snapshot
Unendliche minimalen-fach zusammenhängende 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/jgt.10098openalex-snapshot
Generating cycles in graphs with at most one end
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/jgt.22813openalex-snapshot
End‐faithful spanning trees in graphs without normal spanning trees
inferred← citeshttps://doi.org/10.1002/jgt.3190080309openalex-snapshot
On the reconstruction of rayless infinite forests
inferred← citeshttps://doi.org/10.1002/jgt.3190090202openalex-snapshot
Almost reconstructing infinite, rayless graphs
inferred← citeshttps://doi.org/10.1002/mana.201800055openalex-snapshot
On tree‐decompositions of one‐ended graphs
inferred← citeshttps://doi.org/10.1006/jctb.1997.1795openalex-snapshot
A Note onk-Connected Rayless Graphs
inferred← citeshttps://doi.org/10.1007/978-3-032-17156-6_8openalex-snapshot
Prime Factorization of Hierarchical Products of Infinite Graphs
inferred← citeshttps://doi.org/10.1007/bf03322757openalex-snapshot
On the Cycle Space of an Infinite 3-connected Graph
inferred← citeshttps://doi.org/10.1007/s00493-010-2590-3openalex-snapshot
Every rayless graph has an unfriendly partition
inferred← citeshttps://doi.org/10.1007/s00493-024-00087-2openalex-snapshot
The Number of Topological Types of Trees
inferred← citeshttps://doi.org/10.1007/s00493-024-00131-1openalex-snapshot
Unfriendly Partition Conjecture Holds for Line Graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(92)00526-wopenalex-snapshot
Fixed elements of infinite trees
inferred← citeshttps://doi.org/10.1016/0012-365x(94)90378-6openalex-snapshot
On finite fixed sets in infinite graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00044-wopenalex-snapshot
Finite invariant sets in infinite graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00197-5openalex-snapshot
Stable graphs for a family of endomorphisms
inferred← citeshttps://doi.org/10.1016/0095-8956(92)90022-popenalex-snapshot
On spanning trees and k-connectedness in infinite graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2011.03.034openalex-snapshot
Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes II. Fixed subgraph properties and infinite treelike partial cubes
inferred← citeshttps://doi.org/10.1016/j.disc.2011.03.035openalex-snapshot
Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes I. Topologies and the geodesic convexity
inferred← citeshttps://doi.org/10.1016/j.disc.2020.111959openalex-snapshot
On symmetries of edge and vertex colourings of graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2009.07.045openalex-snapshot
Every rayless graph has an unfriendly partition
inferred← citeshttps://doi.org/10.1017/s096354830000081xopenalex-snapshot
Minimization Problems for Infiniten-Connected Graphs
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.14317/jami.2012.30.1_2.245openalex-snapshot
CHARACTERIZATION THEOREMS FOR CERTAIN CLASSES OF INFINITE GRAPHS y
inferred← citeshttps://doi.org/10.7151/dmgt.2162openalex-snapshot
Trees with distinguishing index equal distinguishing number plus one
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.