✦ LIBER ✦

End-faithful spanning trees inT1-free graphs

✍ Scribed by Polat, Norbert

Publisher: John Wiley and Sons
Year: 1997
Tongue: English
Weight: 161 KB
Volume: 26
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199712)26:4<175::aid-jgt1>3.0.co;2-n

No coin nor oath required. For personal study only.

✦ Synopsis

We prove that any connected graph that contains no subdivision of an ℵ 1regular tree has an end-faithful spanning tree; and furthermore that it has a rayless spanning tree if all its ends are dominated. This improves a result of Seymour and Thomas (An end-faithful spanning tree counterexample, Discrete Math. 95 (1991)).