A note on \(k\)-connected rayless graphs (Q1272481): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1006/jctb.1997.1795 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1006/JCTB.1997.1795 / rank | |||
Normal rank | |||
Latest revision as of 17:14, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on \(k\)-connected rayless graphs |
scientific article |
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
