18 citations · 65 across the 12 of their papers we have counts for
Showing 2016 · math.COShow all
2 papers · 2 filters
math.CO2016
Non-reconstructible locally finite graphs
Nathan Bowler, Joshua Erde, Peter Heinig +2
Two graphs and are \emph{hypomorphic} if there exists a bijection such that for each . A graph is \em…
math.CO2016★ 5 cited
A counterexample to the reconstruction conjecture for locally finite trees
Nathan Bowler, Joshua Erde, Peter Heinig +2
Two graphs and are hypomorphic if there exists a bijection such that for each . A graph is reconstruc…