| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657540 | Journal of Combinatorial Theory, Series B | 2007 | 12 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
