Title of article :
On the reconstruction of planar graphs
Author/Authors :
Bilinski، نويسنده , , Mark and Kwon، نويسنده , , Young Soo and Yu، نويسنده , , Xingxing، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2007
Abstract :
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.
Keywords :
Recognition , Wheel neighborhood , reconstruction , Non-separating cycle , Planar graph
Journal title :
Journal of Combinatorial Theory Series B
Journal title :
Journal of Combinatorial Theory Series B
