Skip to main content

Reconstructing graphs

  • Conference paper
  • First Online:
The Many Facets of Graph Theory

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.00
Price excludes VAT (USA)
  • 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.A. Bondy, On Kelly's congruence theorem for trees, Proc. Cambridge Phil. Soc. (to appear).

    Google Scholar 

  2. J.A. Bondy, On Ulam's conjecture for separable graphs (to appear).

    Google Scholar 

  3. D. Geller and B. Manvel, Reconstruction of cacti, Canad. J. Math. (to appear).

    Google Scholar 

  4. F. Harary and E. Palmer, The reconstruction of a tree from its maximal subtrees, Canad. J. Math., 18 (1966), 803–811.

    Article  MathSciNet  MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  6. F. Harary and E. Palmer, On the problem of reconstructing a tournament from subtournaments, Monatsh. für Math., 71 (1967), 14–23.

    Article  MathSciNet  MATH  Google Scholar 

  7. F. Harary, On the reconstruction of a graph from a collection of subgraphs, in Theory of graphs and its applications (M. Fielder, ed.) Prague, 1964, 47–52.

    Google Scholar 

  8. R.L. Hemminger, On reconstructing a graph, Proc. Amer. Math. Soc., 20, (1969).

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  10. B. Manvel, Reconstruction of trees (to appear).

    Google Scholar 

  11. O. Ore, Theory of graphs, Colloq. Pub., 38, Amer. Math. Soc., Providence, R.I., 1962.

    MATH  Google Scholar 

  12. S.M. Ulam, A collection of mathematical problems, New York, 1960, p. 29.

    Google Scholar 

  13. H. Whitney, Congruent graphs and the connectivity of graphs, Amer. J. Math., 54 (1932), 150–168.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

G. Chartrand S. F. Kapoor

Rights and permissions

Reprints and permissions

Copyright information

© 1969 Springer-Verlag

About this paper

Cite this paper

Greenwell, D.L., Hemminger, R.L. (1969). Reconstructing graphs. In: Chartrand, G., Kapoor, S.F. (eds) The Many Facets of Graph Theory. Lecture Notes in Mathematics, vol 110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0060110

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-04629-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics