Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
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]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Every rayless graph has an unfriendly partitionHenning Bruhn, Reinhard Diestel, Agelos Georgakopoulos, Philipp Sprüssel. combinatorica, 30(5):521-532, 2010. [doi] Twins of rayless graphsAnthony Bonato, Henning Bruhn, Reinhard Diestel, Philipp Sprüssel. JCT, 101(1):60-65, 2011. [doi]
The following publications are possibly variants of this publication: