Minimization Problems for Infinite n-Connected Graphs

DOI10.1017/S096354830000081XzbMath0793.05086OpenAlexW2153914290MaRDI QIDQ4290094

Rudolf Halin

Publication date: 10 August 1994

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s096354830000081x

zbMATH Keywords

tree decomposition\(n\)-connected graph\(n\)-minimizability

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

The structure of rayless graphs ⋮ Unnamed Item ⋮ Locally finite graphs with ends: A topological approach. II: Applications ⋮ A note on \(k\)-connected rayless graphs

Cites Work

• Unnamed Item
• Ein Ordnungsbegriff für Graphen ohne unendliche Wege mit einer Anwendung auf n-fach zusammenhaengende Graphen
• Über unendliche Wege in Graphen
• Charakterisierung der Graphen ohne unendliche Wege
• Über minimal n-fach zusammenhängende, unendliche Graphen und ein Extremalproblem. (On minimal n-fold connected infinite graphs and an extremal problem)
• Über die Maximalzahl fremder unendlicher Wege in Graphen

This page was built for publication: Minimization Problems for Infinite n-Connected Graphs