Twins of rayless graphs

From MaRDI portal
Publication:618035

DOI10.1016/J.JCTB.2010.10.004zbMATH Open1221.05039arXiv0911.3803OpenAlexW2065615449MaRDI QIDQ618035FDOQ618035

Philipp Sprüssel, Anthony Bonato, Reinhard Diestel, Henning Bruhn

Publication date: 14 January 2011

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/0911.3803





Cites Work


Cited In (13)






This page was built for publication: Twins of rayless graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q618035)