End-Faithful Spanning Trees of Countable Graphs with Prescribed Sets of Rays
Norbert Polat · Czechoslovak Mathematical Journal · 2001
We prove that a countable connected graph has an end-faithful spanning tree that contains a prescribed set of rays whenever this set is countable, and we show that this solution is, in a certain sense, the best possible. This improves a result of Hahn and Siran [2, Theorem 1]