A survey on graphs with polynomial growth
Discrete Mathematics
Discrete Mathematics
Journal of Combinatorial Theory Series B
Combinatorica
Combinatorica
The countable Erdös-Menger conjecture with ends
Journal of Combinatorial Theory Series B
Topological paths, cycles and spanning trees in infinite graphs
European Journal of Combinatorics - Special issue: Topological graph theory
The Cycle Space of an Infinite Graph
Combinatorics, Probability and Computing
The Erdös-Menger conjecture for source/sink sets with disjoint closures
Journal of Combinatorial Theory Series B
Combinatorics, Probability and Computing
Journal of Combinatorial Theory Series B
Quasi-isometries between graphs and trees
Journal of Combinatorial Theory Series B
Hi-index | 0.00 |
We compare the notions of an end that exist in the graph-theoretical and, independently, in the topological literature. These notions conflict except for locally finite graphs, and we show how each can be expressed in the context of the other. We find that the topological ends of a graph are precisely the undominated of its graph-theoretical ends, and that graph theoretical ends have a simple topological description generalizing the definition of a topological end.