The size of a graph is reconstructible from any n-2 cards

Paul Brown, Trevor I. Fenner. The size of a graph is reconstructible from any n-2 cards. Discrete Mathematics, 341(1):165-174, 2018. [doi]

@article{BrownF18,
  title = {The size of a graph is reconstructible from any n-2 cards},
  author = {Paul Brown and Trevor I. Fenner},
  year = {2018},
  doi = {10.1016/j.disc.2017.08.026},
  url = {https://doi.org/10.1016/j.disc.2017.08.026},
  researchr = {https://researchr.org/publication/BrownF18},
  cites = {0},
  citedby = {0},
  journal = {Discrete Mathematics},
  volume = {341},
  number = {1},
  pages = {165-174},
}