On the public citation graph

The structure of rayless graphs

https://doi.org/10.1007/bf02942564
0 signed · 28 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/jgt.3190080309openalex-snapshot
On the reconstruction of rayless infinite forests
inferredcites →https://doi.org/10.1002/jgt.3190090202openalex-snapshot
Almost reconstructing infinite, rayless graphs
inferredcites →https://doi.org/10.1002/mana.19660310110openalex-snapshot
Graphen ohne unendliche Wege
inferredcites →https://doi.org/10.1006/jctb.1997.1795openalex-snapshot
A Note onk-Connected Rayless Graphs
inferredcites →https://doi.org/10.1007/bf01192782openalex-snapshot
Ein Ordnungsbegriff f�r Graphen ohne unendliche Wege mit einer Anwendung aufn-fach zusammenh�ngende Graphen
inferredcites →https://doi.org/10.1007/bf01220026openalex-snapshot
Charakterisierung der Graphen ohne unendliche Wege
inferredcites →https://doi.org/10.1016/0012-365x(91)90343-zopenalex-snapshot
Excluding infinite minors
inferredcites →https://doi.org/10.1016/0012-365x(92)00526-wopenalex-snapshot
Fixed elements of infinite trees
inferredcites →https://doi.org/10.1016/0095-8956(92)90022-popenalex-snapshot
On spanning trees and k-connectedness in infinite graphs
inferredcites →https://doi.org/10.1017/s096354830000081xopenalex-snapshot
Minimization Problems for Infiniten-Connected Graphs
inferredcites →https://doi.org/10.1093/oso/9780198532101.001.0001openalex-snapshot
Graph Decotnpositions

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.10098openalex-snapshot
Generating cycles in graphs with at most one end
inferred← citeshttps://doi.org/10.1002/mana.201800055openalex-snapshot
On tree‐decompositions of one‐ended 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/bf02940917openalex-snapshot
A note on graphs with countable automorphism group
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-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.1007/s12188-016-0161-2openalex-snapshot
Rudolf Halin: 1934–2014
inferred← citeshttps://doi.org/10.1007/s12188-016-0169-7openalex-snapshot
Invariant subsets of scattered trees and the tree alternative property of Bonato and Tardif
inferred← citeshttps://doi.org/10.1007/s12188-023-00270-0openalex-snapshot
An example of Tateno disproving conjectures of Bonato–Tardif, Thomasse, and Tyomkyn
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.jctb.2010.10.004openalex-snapshot
Twins of rayless graphs
inferred← citeshttps://doi.org/10.37236/3035openalex-snapshot
Biologically Unavoidable Sequences
inferred← citeshttps://doi.org/10.48550/arxiv.0911.3803openalex-snapshot
Twins of rayless graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1508.01123openalex-snapshot
Invariant subsets of scattered trees. An application to the tree alternative property of Bonato and Tardif
inferred← citeshttps://doi.org/10.55016/ojs/cdm.v17i1.73727openalex-snapshot
Metric properties of incomparability graphs with an emphasis on paths
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.