Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos, Philipp Sprüssel. Every rayless graph has an unfriendly partition. Electronic Notes in Discrete Mathematics, 34:279-281, 2009. [doi]
@article{BruhnDGS09,
title = {Every rayless graph has an unfriendly partition},
author = {Henning Bruhn and Reinhard Diestel and Agelos Georgakopoulos and Philipp Sprüssel},
year = {2009},
doi = {10.1016/j.endm.2009.07.045},
url = {http://dx.doi.org/10.1016/j.endm.2009.07.045},
tags = {graph-rewriting, rewriting, partitioning},
researchr = {https://researchr.org/publication/BruhnDGS09},
cites = {0},
citedby = {0},
journal = {Electronic Notes in Discrete Mathematics},
volume = {34},
pages = {279-281},
}