The structure of rayless graphs
From MaRDI portal
Publication:1969639
DOI10.1007/BF02942564zbMath0946.05070MaRDI QIDQ1969639
Publication date: 19 March 2000
Published in: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)
05C05: Trees
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C75: Structural characterization of families of graphs
Related Items
A note on graphs with countable automorphism group, Twins of rayless graphs, On symmetries of edge and vertex colourings of graphs, On the cycle space of an infinite 3-connected graph, Invariant subsets of scattered trees and the tree alternative property of Bonato and Tardif
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ein Ordnungsbegriff für Graphen ohne unendliche Wege mit einer Anwendung auf n-fach zusammenhaengende Graphen
- Excluding infinite minors
- On spanning trees and \(k\)-connectedness in infinite graphs
- A note on \(k\)-connected rayless graphs
- Fixed elements of infinite trees
- Charakterisierung der Graphen ohne unendliche Wege
- On the reconstruction of rayless infinite forests
- Almost reconstructing infinite, rayless graphs
- Minimization Problems for Infinite n-Connected Graphs
- Graphen ohne unendliche Wege