11 citations · 27 across the 20 of their papers we have counts for
Showing 2023 · math.COShow all
2 papers · 2 filters
math.CO2023
A refinement of Kelly's lemma for graph reconstruction for counting rooted subgraphs
Deisiane Lopes Gonçalves, Bhalchandra D. Thatte
Kelly's lemma is a basic result on graph reconstruction. It states that given the deck of a graph on vertices, and a graph on fewer than vertices, we can count the…
math.CO2023
On the class reconstruction number of trees
Ilia Krasikov, Yehuda Roditty, Bhalchandra D. Thatte
Harary and Lauri conjectured that the class reconstruction number of trees is 2, that is, each tree has two unlabelled vertex-deleted subtrees that are not both in the deck of any…