Skip to main content

Reflections on the legitimate deck problem

  • Invited Addresses
  • Conference paper
  • First Online:
Combinatorial Mathematics

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

Abstract

We study the following problem: given a collection H=(Hi‖1≤i≤n) of n graphs, each on n-1 vertices, when does there exist a graph G whose vertex-deleted subgraphs are the members of H?

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 and R.L. Hemminger, "Graph reconstruction — a survey", J. Graph Theory 1(1977), to appear.

    Google Scholar 

  2. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, MacMillan, London and American Elsevier, New York, 1976.

    Book  MATH  Google Scholar 

  3. J. Dénes and A.D. Keedwell, Latin Squares and their Applications, Academic Press, New York, 1974.

    MATH  Google Scholar 

  4. A.W. Goodman, "On sets of acquaintances and strangers at any party", Amer. Math. Monthly 66(1959), 778–783.

    Article  MathSciNet  MATH  Google Scholar 

  5. U. Hafstrøm, personal communication, 1976.

    Google Scholar 

  6. F. Harary, "On the reconstruction of a graph from a collection of subgraphs", in, Theory of Graphs and its Applications, (Proceedings of the Symposium held in Prague, 1964), edited by M. Fielder, Czechoslovak Academy of Sciences, Prague, 1964, 47–52.

    Google Scholar 

  7. F. Harary, "The four color conjecture and other graphical diseases", in Proof Techniques in Graph Theory, (Proceedings of the Second Ann Arbor Graph Theory Conference, Ann Arbor, Mich., 1968), edited by F. Harary, Academic Press, New York, 1969, 1–9.

    Google Scholar 

  8. W. Jackson, "Legitimate decks", preprint, 1977.

    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, "On reconstruction of graphs", in The Many Facets of Graph Theory, (Proceedings of the Conference held at Western Michigan University, Kalamazoo, Mich., 1968), edited by G. Chartrand and S.F. Kapoor, Lecture Notes in Math., Vol. 110, Springer-Verlag, New York, 207–214.

    Google Scholar 

  11. B. Manvel, "On reconstructing graphs from their sets of subgraphs", J. Combinatorial Theory (B), 21(1976), 156–165.

    Article  MathSciNet  MATH  Google Scholar 

  12. B.D. McKay, "Computer reconstruction of small graphs", J. Graph Theory 1(1977), to appear.

    Google Scholar 

  13. S. Ramachandran, "A test for legitimate decks", preprint, 1977.

    Google Scholar 

  14. M. Randić, "On the reconstruction problem for graphs", preprint, 1977.

    Google Scholar 

  15. J.E. Simpson, "Legitimate decks of graphs", Notices Amer. Math. Soc. 21(1974), A-39.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

D. A. Holton Jennifer Seberry

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag

About this paper

Cite this paper

Bondy, J.A. (1978). Reflections on the legitimate deck problem. In: Holton, D.A., Seberry, J. (eds) Combinatorial Mathematics. Lecture Notes in Mathematics, vol 686. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0062511

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08953-7

  • Online ISBN: 978-3-540-35702-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics