|
|||||
|
|
End-faithful spanning trees in T1-free graphs |
|
| Authors: | Norbert Polat |
| Abstract: | We prove that any connected graph that contains no subdivision of an ℵ1-regular 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)). © 1997 John Wiley & Sons, Inc. J Graph Theory 26: 175–181, 1997 |
| Keywords: | |