| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657028 | Journal of Combinatorial Theory, Series B | 2011 | 6 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
