19 citations · 41 across the 26 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
math.CO2009
Twins of rayless graphs
A. Bonato, H. Bruhn, R. Diestel +1
Two non-isomorphic graphs are twins if each is isomorphic to a subgraph of the other. We prove that a rayless graph has either infinitely many twins or none.
math.CO2009
Every rayless graph has an unfriendly partition
Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos +1
We prove that every rayless graph has an unfriendly partition.