Skip to main content

A survey of the reconstruction conjecture

Part I: Invited Papers

Part of the Lecture Notes in Mathematics book series (LNM,volume 406)

Abstract

We begin by tracing the history of the Reconstruction Conjecture (RC) for graphs. After describing the RC as the problem of reconstructing a graph G from a given deck of cards, each containing just one point-deleted subgraph of G, we proceed to derive information about G which is deducible from this deck.

Various theorems proving the RC for trees are then taken up. The status of the RC for digraphs is reported. Several variations of the RC are stated and partial results obtained to date are indicated. We conclude with a summary of structures other than trees which have been reconstructed, and some remarks on the reconstruction of countably infinite graphs.

Keywords

  • Combinatorial Theory
  • Reconstruction Problem
  • Outerplanar Graph
  • Unicyclic Graph
  • Chromatic Polynomial

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arjomandi, E. and Corneil, D. G., "Unicyclic graphs satisfy Harary's conjecture," Canad. Math. Bull., to appear.

    Google Scholar 

  2. Beineke, L. W., and Parker, E. M., "On nonreconstructable tournaments," J. Combinatorial Theory 9 (1970) 324–326.

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. Bondy, J. A., "On Kelly's congruence theorem for trees," Proc. Cambridge Philos. Soc. 65 (1969), 1–11.

    CrossRef  MathSciNet  Google Scholar 

  4. Bondy, J. A., "On Ulam's Conjecture for separable graphs," Pacific J. Math. 31 (1969), 281–288.

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. Bondy, J. A., and Hemminger, R. L., "Almost reconstructing infinite graphs," Pacific J. Math., to appear.

    Google Scholar 

  6. Bondy, J. A., and Hemminger, R. L., "Reconstructing infinite graphs," Unpublished.

    Google Scholar 

  7. Bryant, R. M., "On a conjecture concerning the reconstruction of graphs," J. Combinatorial Theory 11 (1971), 139–141.

    MATH  Google Scholar 

  8. Brylawski, T. A., "Reconstructing combinatorial geometries," this volume p. 226.

    Google Scholar 

  9. Chartrand, G., and Kronk, H. V., "On reconstructing disconnected graphs," Ann. N. Y. Acad. Sci. 175 (1970), 85–86.

    MathSciNet  MATH  Google Scholar 

  10. Chinn, P. Z., "A graph with p points and enough distinct (p-2) order subgraphs is reconstructable," Recent Trends in Graph Theory, (M. Capobianco et al., eds.), Springer, Berlin, 1971, 71–73.

    CrossRef  Google Scholar 

  11. Faber, V., “Reconstruction of graphs from indexed p-2 point subgraphs,” Notices Amer. Math. Soc. 18 (1971), 807.

    Google Scholar 

  12. Fisher, J., "A counterexample to the countable version of a conjecture of Ulam," J. Combinatorial Theory, 7 (1969), 364–365.

    CrossRef  MathSciNet  MATH  Google Scholar 

  13. Fisher, J., Graham, R. L., and Harary, F., "A simpler counterexample to the reconstruction conjecture for denumerable graphs," J. Combinatorial Theory 12B (1972), 203–204.

    MathSciNet  Google Scholar 

  14. Giles, W. B., "On reconstructing maximal outerplanar graphs," Discrete Math., to appear.

    Google Scholar 

  15. Giles, W.B., "The reconstruction of outerplanar graphs," Michigan Math. J., to appear.

    Google Scholar 

  16. Greenwell, D. L., "Reconstructing graphs," Proc. Amer. Math. Soc. 30 (1971), 431–433.

    CrossRef  MathSciNet  Google Scholar 

  17. Greenwell, D. L., and Hemminger, R. L., "Reconstructing graphs," The Many Facets of Graph Theory (G. T. Chartrand and S. F. Kapoor, eds.) Springer, Berlin, 1969, 91–114.

    CrossRef  Google Scholar 

  18. Harary, F., "An elementary theorem on graphs," Amer. Math. Monthly 66 (1959) 405–407.

    CrossRef  MathSciNet  MATH  Google Scholar 

  19. Harary, F., "Graphical reconstruction," A Seminar on Graph Theory (F. Harary, ed.), Holt, New York, 1967, 18–20.

    Google Scholar 

  20. Harary, F., Graph Theory, Addison-Wesley, Reading, 1969.

    Google Scholar 

  21. Harary, F., "On the reconstruction of a graph from a collection of subgraphs," Theory of Graphs and its Applications (M. Fiedler, ed.) Academic Press, New York, 1964, 47–52.

    Google Scholar 

  22. Harary, F., and Manvel, B., "The reconstruction conjecture for labeled graphs," Combinatorial Structures and Their Applications (R. K. Guy, ed.) Gordon and Breach, New York, 1969, 131–146.

    Google Scholar 

  23. Harary, F., and Manvel, G., "Reconstruction of square-celled animals," Bull. Soc. Math. Belg. 25 (1973) 80–84.

    Google Scholar 

  24. Harary, F., and Palmer, E. M., "On the problem of reconstructing a tournament from subtournaments," Monatsh. Math. 71 (1967), 14–23.

    CrossRef  MathSciNet  MATH  Google Scholar 

  25. Harary, F., and Palmer, E. M., "A note on similar lines of a graph," Rev. Roum. Math. Pures et Appl. 10 (1965), 1489–1492.

    MathSciNet  MATH  Google Scholar 

  26. Harary, F., and Palmer, E.M., "On similar points of a graph," J. Math. Mech. 15 (1966), 623–630.

    MathSciNet  MATH  Google Scholar 

  27. Harary, F., and Palmer, E.M., "The reconstruction of a tree from its maximal proper subtrees," Canad. J. Math. 18 (1966), 803–810.

    CrossRef  MathSciNet  MATH  Google Scholar 

  28. Harary, F., Schwenk, A. J., and Scott, R. L., "On the reconstruction of countable forests," Publ. Math. Inst. (Beograd) 13 (1972), 39–42.

    MathSciNet  Google Scholar 

  29. Hemminger, R. L., "On reconstructing a graph," Proc. Amer. Math. Soc. 20 (1969), 185–187.

    CrossRef  MathSciNet  MATH  Google Scholar 

  30. Kelly, P. J., "A congruence theorem for trees," Pacific J. Math. 7 (1957), 961–968.

    CrossRef  MathSciNet  MATH  Google Scholar 

  31. Kelly, P. J., "On some mappings related to graphs," Pacific J. Math. 14 (1964), 191–194.

    CrossRef  MathSciNet  MATH  Google Scholar 

  32. Lovász, L., "Operations with structures," Acta Math. 18 (1967), 321–328.

    MATH  Google Scholar 

  33. Lovász, L., "A note on the line reconstruction problem," J. Combinatorial Theory, 13B (1972), 309–310.

    Google Scholar 

  34. Manvel, B., "On reconstruction of graphs," Doctoral dissertation, Univ. of Michigan, 1970.

    Google Scholar 

  35. Manvel, B., "Reconstruction of unicyclic graphs," Proof Techniques in Graph Theory (F. Harary, ed.) Academic Press, New York, 1969, 103–107.

    Google Scholar 

  36. Manvel, B., "Reconstruction of trees," Canad. J. Math 22 (1970), 55–60.

    CrossRef  MathSciNet  MATH  Google Scholar 

  37. Manvel, B., "On reconstruction of graphs," The Many Facets of Graph Theory (G. T. Chartrand and S. F. Kapoor, eds.) Springer, Berlin, 1969, 207–214.

    CrossRef  Google Scholar 

  38. Manvel, B., "Reconstructing the degree pair sequence of a digraph," J. Combinatorial Theory, 15B, (1973) 18–31.

    MathSciNet  Google Scholar 

  39. Manvel, B., "Reconstruction of maximal outerplanar graphs," Discrete Math. 2 (1972), 269–278.

    CrossRef  MathSciNet  MATH  Google Scholar 

  40. Manvel, B. Determining Connectedness from Subdigraphs," J. Combinatorial Theory, to appear.

    Google Scholar 

  41. Manvel, B., "Some basic observations on Kelly's Conjecture for graphs," Discrete Math., to appear.

    Google Scholar 

  42. Manvel, B., and Geller, D. P., "Reconstruction of cacti," Canad. J. Math. 21 (1969), 1354–1360.

    CrossRef  MathSciNet  MATH  Google Scholar 

  43. Manvel, B., and Stockmeyer, P., "Reconstruction of matrices," Math. Mag., 44 (1971), 218–221.

    CrossRef  MathSciNet  MATH  Google Scholar 

  44. O'Neil, P. V., "Ulam's conjecture and graph reconstructions," Amer. Math. Monthly 77 (1970), 35–43.

    CrossRef  MathSciNet  MATH  Google Scholar 

  45. Ulam, S. M., A Collection of Mathematical Problems, Wiley, New York, 1960, p. 29.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1974 Springer-Verlag Berlin

About this paper

Cite this paper

Harary, F. (1974). A survey of the reconstruction conjecture. In: Bari, R.A., Harary, F. (eds) Graphs and Combinatorics. Lecture Notes in Mathematics, vol 406. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0066431

Download citation

  • DOI: https://doi.org/10.1007/BFb0066431

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06854-9

  • Online ISBN: 978-3-540-37809-9

  • eBook Packages: Springer Book Archive