| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 11021704 | Journal of Combinatorial Theory, Series B | 2018 | 31 Pages |
Abstract
In this paper we construct non-reconstructible connected graphs of bounded maximum degree with one and countably many ends respectively, answering the two questions of Nash-Williams about the reconstruction of locally finite graphs in the negative.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Nathan Bowler, Joshua Erde, Peter Heinig, Florian Lehner, Max Pitz,