Resumen de On the reconstruction of planar graphs

Mark Bilinski, Young Soo Kwon, Xingxing Yu

• We show that the planarity of a graph can be recognized from its vertex deleted subgraphs, which answers a question posed by Bondy and Hemminger in 1979. We also state some useful counting lemmas and use them to reconstruct certain planar graphs.