A survey of some open questions in reconstruction numbers

Ars Combinatoria

Volumn 97, Issue , 2010, Pages 443-456

  Asciak, K J ^a   Francalanza, M A ^a   Lauri, J ^a   Myrvold, W ^b  

^a UNIVERSITY OF MALTA   (Malta)

^b UNIVERSITY OF VICTORIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77958466475     PISSN: 03817032     EISSN: 28175204     Source Type: Journal    
DOI: None     Document Type: Review

References (27)

1. N. Alón, Y. Caro, I. Krasikov, and Y. Roditty. Combinatorial reconstruction problems. J. Combin. Theory (Ser. B), 47:153-161, 1989.
2. K.J. Asciak. On certain classes of graphs with large reconstruction number. Master's thesis, University of Malta, 1998.
3. K.J. Asciak and J. Lauri. On the edge-reconstruction number of disconnected graphs. Pre-print.
4. K.J. Asciak and J. Lauri. On disconnected graphs with large reconstruction number. Ars Combinatoria, 62:173-181, 2002.
5. B. Bollobas. Almost every graph has reconstruction number 3. J. Graph Theory, 14:1-4, 1990.
6. A. Bowler, P. Brown, and T. Fenner. Families of pairs of graphs with a large number of common cards. Preprint.
7. P. Brown. Personal communcation.
8. S. Fiorini and J. Lauri. The reconstruction of maximal planar graphs, I: Recognition. J. Combin. Theory (Ser. B), 30:188-195, 1981.
9. M. A. Francalanza. The adversary reconstruction of trees: The case of caterpillars and sunshine graphs. Master's thesis, University of Malta, 1999.
10. F. Harary. Graph Theory. Addison-Wesley, 1969.
11. F. Harary and J. Lauri. The class-reconstruction number of maximal planar graphs. Graphs and Combinatorics, 3:45-53, 1987.
12. F. Harary and J. Lauri. On the class-reconstruction number of trees. Quart. J. Math. Oxford (2), 39:47-60, 1988.
13. F. Harary and M. Plantholt. The graph reconstruction number. J. Graph Theory, 9:451-454, 1985.
14. J. Lauri. The reconstruction of maximal planar graphs, II: Reconstruction. J. Combin. Theory (Ser. B.), 30:196-214, 1981.
15. J. Lauri. The Reconstruction Problem. In J. L. Gross and J. Yellen, editors, Handbook of Graph Theory, pages 79-98. CRC Press, 2004.
16. J. Lauri and R. Scapellato. Topics in Graph Automorphisms and Reconstruction. Cambridge University Press, 2003.
17. B. McMullen and S.P. Radziszowski. Graph reconstruction numbers. J. Combin. Math. Combin. Comp., to appear.
18. R. Molina. The edge reconstruction number of a tree. Vishwa International J. Graph Theory, 2(2):117-130, 1993.
19. R. Molina. Correction of a proof on the ally-reconstruction number of a disconnected graph. Ars Combinatoria, 40:59-64, 1995.
20. R. Molina. The edge reconstruction number of a disconnected graph. J. Graph Theory, 19(3):375-384, 1995.
21. V. Müller. Probabilistic reconstruction from subgraphs. Comment. Math. Univ. Carolinae, 17:709-719, 1976.
22. W.J. Myrvold. Ally and Adversary Reconstruction Problems. PhD thesis, University of Waterloo, Ontario, Canada, 1988.
23. W.J. Myrvold. The ally-reconstruction number of a disconnected graph. Ars Combin., 28:123-127, 1989.
24. W.J. Myrvold. The ally reconstruction number of a tree with five or more vertices is three. J. Graph Theory, 14:149-166, 1990.
25. n. J. Combin. Theory (Ser. A), 83(2):169-187, 1998.
26. A. J. Radcliffe and A. D. Scott. Reconstructing subsets of reals. Electron. J. Combin., (1):Research Paper 20, 7pp., 1999.
27. n up to groups of isometries. Europ. J. Combinatorics, 22:1139-1147, 2001.