Skip to main content
SpringerLink
Log in

On reconstruction of 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

Log in via an institution
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. Canad. J. Math. (to appear)

    Google Scholar 

  3. G.A. Dirac, A property of 4-chromatic graphs and some remarks on critical graphs. J. London Math. Soc. 27 (1952), 85–92.

    Article  MathSciNet  MATH  Google Scholar 

  4. D.L. Greenwell and R.L. Hemminger, Reconstruction graphs (this volume).

    Google Scholar 

  5. F. Harary, Graph theory. Addison-Wesley, Reading, 1969.

    MATH  Google Scholar 

  6. F. Harary, On the reconstruction of a graph from a collection of subgraphs. Theory of graphs and its applications (M. Fielder, ed.), Prague, 1964, pp. 47–52; reprinted Academic Press, New York, 1964.

    Google Scholar 

  7. F. Harary and E.M. Palmer, On the problem of reconstructing a tournament from subtournaments. Monat. für Mathematik 71 (1967), 14–23.

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  11. B. Manvel, Reconstruction of unicyclic graphs. Proof techniques in graph theory (F. Harvary, ed.) Academic Press, New York, 1969.

    Google Scholar 

  12. B. Manvel, Reconstruction of trees. Canad. J. Math. (to appear).

    Google Scholar 

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

    Google Scholar 

  14. B. Manvel and P.K. Stockmeyer, On reconstruction of matrices. (submitted for publication).

    Google Scholar 

  15. S.M. Ulam, A collection of mathematical problems. Wiley (interscience), New York, 1960, p. 29.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Michigan, USA

    Bennet Manvel

Authors
  1. Bennet Manvel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

G. Chartrand S. F. Kapoor

Rights and permissions

Reprints and permissions

Copyright information

© 1969 Springer-Verlag

About this paper

Cite this paper

Manvel, B. (1969). On reconstruction of 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/BFb0060119

Download citation

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

  • 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

Search

Navigation