A note on \(k\)-connected rayless graphs

DOI10.1006/jctb.1997.1795zbMath0920.05059OpenAlexW2030940220MaRDI QIDQ1272481

Rudolf Halin

Publication date: 3 January 1999

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1997.1795

zbMATH Keywords

connectivitytree decompositioninfinite graphrayless graph

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Connectivity (05C40)

Related Items (1)

The structure of rayless graphs

Cites Work

• Ein Ordnungsbegriff für Graphen ohne unendliche Wege mit einer Anwendung auf n-fach zusammenhaengende Graphen
• On spanning trees and \(k\)-connectedness in infinite graphs
• Minimization Problems for Infinite n-Connected Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on \(k\)-connected rayless graphs