“…An end of
is dominated if one (equivalently: each) of its rays is dominated, see [
6]. For a connected graph
, having a rayless spanning tree is equivalent to all the ends of
being dominated if
is normally spanned [
4] or if
does not contain a subdivision of
[
12]. Our second main result extends these results, and any
with all tops witnesses that this extension is proper.…”