“…In this section, we prove that for every normally traceable graph
, having a rayless spanning tree is equivalent to all the ends of
being dominated. Our proof builds on the following theorem from the third paper of the star‐comb series [
2–5] that hides a six page argument:…”