The reconstruction of outerplanar graphs

Abstract Ulam's conjecture is that a graph G with at least three vertices can be reconstructed from the family of subgraphs of G obtained by deleting single vertices of G . This paper proves the conjecture for G outerplanar, by working first with partially labeled graphs and then applying the results obtained to the unlabeled case.

[1]  Bennet Manvel,et al.  Reconstruction of Cacti , 1969, Canadian Journal of Mathematics.

[2]  J. A. Bondy,et al.  On Ulam’s conjecture for separable graphs , 1969 .

[3]  Frank Harary,et al.  The Reconstruction of a Tree from its Maximal Subtrees , 1966, Canadian Journal of Mathematics.

[4]  S. Ulam.  A collection of mathematical problems , 1960 .

[5]  J. A. Bondy,et al.  On Kelly's congruence theorem for trees , 1969, Mathematical Proceedings of the Cambridge Philosophical Society.

[6]  P. Kelly.  A congruence theorem for trees. , 1957 .

[7]  John Mitchem.  Hypo-properties in graphs , 1969 .

[8]  Bennet Manvel,et al.  Reconstruction of Trees , 1970, Canadian Journal of Mathematics.

[9]  Bennet Manvel,et al.  Reconstruction of maximal outerplanar graphs , 1972, Discret. Math..