Name
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.jctb.2010.10.004 | J. Comb. Theory, Ser. B |
Keywords | Field | DocType |
graph homomorphism,infinite graphs,rayless graph,rayless graphs,non-isomorphic graph,embedding | Discrete mathematics,Indifference graph,Combinatorics,Graph homomorphism,Partial k-tree,Chordal graph,Cograph,Pathwidth,Universal graph,1-planar graph,Mathematics | Journal |
Volume | Issue | ISSN |
101 | 1 | Journal of Combinatorial Theory, Series B |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Anthony Bonato | 1 | 156 | 18.57 |
| henning bruhn | 2 | 177 | 24.93 |
| Reinhard Diestel | 3 | 452 | 68.24 |
| Philipp Sprüssel | 4 | 46 | 8.52 |