Ein Ordnungsbegriff für Graphen ohne unendliche Wege mit einer Anwendung auf n-fach zusammenhaengende Graphen

DOI10.1007/BF01192782zbMath0526.05058OpenAlexW2142990148MaRDI QIDQ594905

Sumit K. Garg

Publication date: 1983

Published in: Archiv der Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01192782

zbMATH Keywords

one-way infinite pathorder of an infinite graphrayless graph

Mathematics Subject Classification ID

Graph theory (05C99) Connectivity (05C40)

Related Items (19)

Fixed elements of infinite trees ⋮ On finite fixed sets in infinite graphs ⋮ Minimization Problems for Infinite n-Connected Graphs ⋮ Stable graphs for a family of endomorphisms ⋮ Trees with distinguishing index equal distinguishing number plus one ⋮ Twins of rayless graphs ⋮ Duality theorems for stars and combs I: Arbitrary stars and combs ⋮ End‐faithful spanning trees in graphs without normal spanning trees ⋮ Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes. I: Topologies and the geodesic convexity ⋮ Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes. II: Fixed subgraph properties and infinite treelike partial cubes ⋮ The structure of rayless graphs ⋮ Every rayless graph has an unfriendly partition ⋮ Every rayless graph has an unfriendly partition ⋮ On spanning trees and \(k\)-connectedness in infinite graphs ⋮ On the reconstruction of rayless infinite forests ⋮ Finite invariant sets in infinite graphs ⋮ A note on \(k\)-connected rayless graphs ⋮ On symmetries of edge and vertex colourings of graphs ⋮ On the cycle space of an infinite 3-connected graph

Cites Work

• Charakterisierung der Graphen ohne unendliche Wege

This page was built for publication: Ein Ordnungsbegriff für Graphen ohne unendliche Wege mit einer Anwendung auf n-fach zusammenhaengende Graphen