Sciweavers

Share
JCT
2011

Twins of rayless graphs

9 years 5 months ago
Twins of rayless graphs
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.
Anthony Bonato, Henning Bruhn, Reinhard Diestel, P
Added 14 May 2011
Updated 14 May 2011
Type Journal
Year 2011
Where JCT
Authors Anthony Bonato, Henning Bruhn, Reinhard Diestel, Philipp Sprüssel
Comments (0)
books