Reconstruction from smaller cards
The $\ell$-deck of a graph $G$ is the multiset of all induced subgraphs of $G$ on $\ell$ vertices. We say that a graph is reconstructible from its $\ell$-deck if no other graph has the same $\ell$-deck. In 1957, Kelly showed that every tree with $n\ge3$ vertices can be reconstructed from its $(n-1)$...
| Main Authors: | , , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Springer Nature
2021
|