𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Accessibility and Ends of Graphs

✍ Scribed by Rögnvaldur G. Möller

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
337 KB
Volume
66
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Metric ends, fibers and automorphisms of
Metric ends, fibers and automorphisms of graphs
✍ Bernhard Krön; Rögnvaldur G. Möller 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 180 KB

## Abstract Several results on the action of graph automorphisms on ends and fibers are generalized for the case of metric ends. This includes results on the action of the automorphisms on the end space, directions of automorphisms, double rays which are invariant under a power of an automorphism a

Decomposing Ends of Locally Finite Graph
Decomposing Ends of Locally Finite Graphs
✍ Heinz Adolf Jung; Peter Niemeyer 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 905 KB

An important invariant of translations of infinite locally finite graphs is that of a direction as introduced by HALIN. This invariant gives not much information if the translation is not a proper one. A new refined concept of directions is investigated. A double ray D of a graph X is said to be me

Menger's theorem for infinite graphs wit
Menger's theorem for infinite graphs with ends
✍ Henning Bruhn; Reinhard Diestel; Maya Stein 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB

## Abstract A well‐known conjecture of Erdős states that given an infinite graph __G__ and sets __A__, ⊆ __V__(__G__), there exists a family of disjoint __A__ − __B__ paths 𝓅 together with an __A__ − __B__ separator __X__ consisting of a choice of one vertex from each path in 𝓅. There is a natural

The end structure of a graph: recent res
The end structure of a graph: recent results and open problems
✍ Reinhard Diestel 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 1022 KB

This paper aims to give a brief introduction to a set of problems, old and new, concerned with one of the main and long-standing quests in infinite graph theory: how to represent the end structure of a given graph by that of a simpler subgraph, in particular a spanning tree. There has been a fair am