3 citations · 3 across the 2 of their papers we have counts for
2 papers
math.CO2016
The degree-associated edge-reconstruction number of disconnected graphs and trees
Kevin J. Asciak
An edge-card of a graph G is a subgraph formed by deleting an edge. The edge-reconstruction number of a graph G, ern(G), is the minimum number of edge-cards required to determine G…
math.CO2013★ 3 cited
On the edge-reconstruction number of a tree
Kevin Asciak, Josef Lauri, Wendy Myrvold +1
The edge-reconstruction number ern of a graph is equal to the minimum number of edge-deleted subgraphs of which are sufficient to determine up to isomorphsim…