François Laviolette, Norbert Polat. Spanning trees of countable graphs omitting sets of dominated ends. Discrete Mathematics, 194(1-3):151-172, 1999. [doi]
@article{LavioletteP99,
title = {Spanning trees of countable graphs omitting sets of dominated ends},
author = {François Laviolette and Norbert Polat},
year = {1999},
doi = {10.1016/S0012-365X(98)00042-9},
url = {http://dx.doi.org/10.1016/S0012-365X(98)00042-9},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/LavioletteP99},
cites = {0},
citedby = {0},
journal = {Discrete Mathematics},
volume = {194},
number = {1-3},
pages = {151-172},
}