A note on \(k\)-connected rayless graphs (Q1272481)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on \(k\)-connected rayless graphs |
scientific article; zbMATH DE number 1234264
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on \(k\)-connected rayless graphs |
scientific article; zbMATH DE number 1234264 |
Statements
A note on \(k\)-connected rayless graphs (English)
0 references
3 January 1999
0 references
A rayless graph is an infinite graph which contains no infinite path. \textit{R. Diestel} [J. Comb. Theory, Ser. B 56, No. 2, 263-277 (1992; Zbl 0780.05013)] gave a beautiful description of rayless graphs by showing that they decompose into finite \(k\)-connected graphs in a tree-like manner. In the paper under review a new and short proof of the above result is given.
0 references
connectivity
0 references
tree decomposition
0 references
rayless graph
0 references
infinite graph
0 references
0 references
0.89682364
0 references
0.88897955
0 references
0.8834219
0 references
0.88050675
0 references
