A survey on edge reconstruction of graphs

Journal of Discrete Mathematical Sciences and Cryptography

Volumn 5, Issue 1, 2002, Pages 1-11

  Maccari, Alicia ^a   Rueda, Olga ^a   Viazzi, Vilma ^a  

^a UNIVERSIDAD NACIONAL DEL SUR   (Argentina)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77955554915     PISSN: 09720529     EISSN: None     Source Type: Journal    
DOI: 10.1080/09720529.2002.10697932     Document Type: Article

References (69)

1. P. G. Aleksanjan, Harary’s conjecture, Univ. Mat. Vaprosy Kibernet.i Vycisl. Tehn. No. 9, Teorija Grafov, pp. 16-20 (1979).
2. N. Alon, Y. Caro, I. Krasikov and Y. Roditty, Combinatorial reconstruction problems, J. Comb. Theory, Ser. B, Vol. 47, pp. 153-161 (1989).
3. Th. Andreae, On the edge reconstruction of locally finite disconnected graphs with a finite number of components, Abh. Math. Semin. Univ. Hamb., Vol. 55, pp. 229-238 (1985).
4. Th. Andreae, Simpler counterexamples to the edge-reconstruction conjecture for infinite graphs, J. Comb. Theory, Ser. B., Vol. 32, pp. 258-263 (1982).
5. G. Avellis and L. Borzacchini, Reconstruction theory for G-graphs, Ars Comb., Vol. 25A, pp. 173-177 (1988).
6. D. Barnette, Trees in polytopal graphs, Can. J. Math., Vol. XVIII, pp. 731-736 (1966).
7. th Br. Comb. Conf., Guildford/UK 1991, Lond. Math. Soc. Led. Note Ser. 166, pp. 221-252 (1991).
8. J. A. Bondy, Some Uniqueness Theorems in Graph Theory, Ph.D. Thesis, Oxford University (1968).
9. J. A. Bondy and R. L. Hemminger, Graph reconstruction - a survey, J. Graph Theory, Vol. 1, No. 3, pp. 227-268 (1977).
10. R. C. Brigham and R. D. Dutton, C-graphs are recognizable and edge reconstructible, Congr. Numerantium, Vol. 28, pp. 377-387 (1980).
11. Y. Caro, I. Krasikov and Y. Roditty, Spanning trees and some edge reconstructible graphs, Ars Comb., Vol. 20A, pp. 109-118 (1985).
12. J. Caunter and C. St. J. A. Nash-Williams, Degree conditions for edge reconstruction, manuscript (1982).
13. C. R. J. Clap ham and J. Sheehan, Edge-reconstruction and k-free graphs, Ars Comb., Vol. 29C, pp. 107-109 (1990).
14. W. Dorfler, On the edge-reconstruction of graphs, Bull. Aust. Math. Soc., Vol. 10, pp. 79-84 (1974).
15. M. N. Ellingham, Recent progress in edge reconstruction, Congr. Numerantium, Vol. 62, pp. 3-20 (1987).
16. M. N. Ellingham, D. G. Hoffman and W. J. Myrvold, Bidegreed graphs are edge reconstructible, J. Graph Theory, Vol. 11, No. 3, pp. 281-302 (1987).
17. M. N. Ellingham, L. Pyber and X. Yu, Claw-free graphs are edge reconstructible, J. Graph Theory, Vol. 12, No. 3, pp. 445-451 (1988).
18. H. Fan, Edge reconstruction of planar graphs with minimum degree at least three I, Syst. Sci. Math. Sci., Vol. 6, No. 4, pp. 376-382 (1993).
19. II. Fan, Edge reconstruction of planar graphs with minimum degree at least three II, Syst. Sci. Math. Sci., Vol. 7, No. 1, pp. 49-55 (1994).
20. H. Fan, Edge reconstruction of planar graphs with minimum degree at least three III, Syst. Sci. Math. Sci., Vol. 7, No. 2, pp. 115-120 (1994).
21. H. Fan and B. Xu, On the fixed edge of planar graphs with minimum degree five, Discrete Math., Vol. 152, Nos. 1-3, pp. 325-328 (1996).
22. H. Fan and L. Xie, On reconstructible local subgraphs, Adv. in Math. (China), Vol. 25, No. 1, pp. 65-70 (1996).
23. S. Fiorini, On the edge reconstruction of planar graphs, Math. Proc. Cambridge Philos. Soc., Vol. 83, No. 1, pp. 31-35 (1978).
24. S. Fiorini and J. Lauri, Edge reconstruction of graphs with topological properties, Ann. Discrete Math., Vol. 17, pp. 285-288 (1983).
25. S. Fiorini and J. Lauri, Edge reconstruction of 4-connected planar graphs, J. Graph Theory, Vol. 6, No. 1, pp. 33-42 (1982).
26. S. Fiorini and J. Lauri, On the edge-reconstruction of graphs which triangulate surfaces, Q. J. Math., Oxf. II. Ser. 33, No. 130, pp. 191-214 (1982).
27. C. D. Godsil, I. Krasikov and Y. Roditty, Reconstructing graphs from their &-edge deleted subgraphs, J. Comb. Theory, Ser. B, Vol. 43, pp. 360-363 (1987).
28. D. L. Greenwell, Reconstructing graphs, Proc. Am. Math. Soc., Vol. 30, pp. 431-433 (1971).
29. D. L. Greenwell and R. L. Hemminger, Reconstructing graphs. Many Facets of Graph Theory, Proc. Conf. Western Michigan Univ., Kalamazoo/Mi., 1968, pp. 91-114 (1969).
30. D. L. Greenwell and R. L. Hemminger, Reconstructing the;i-connected components of a graph, Aequationes Math., Vol. 9, pp. 19-22 (1973).
31. F. Harary, On the reconstruction of a graph from a collection of subgraphs, in Theory of Graphs and its Applications, L. M. Fieder (ed.), Czechoslovak Academy of Sciences, Program/Academic Press, N. York, pp. 47-52 (1964).
32. R. L. Hemminger, On reconstructing a graph, Proc. Am. Math. Soc., Vol. 20, pp. 185-187 (1969).
33. D. G. Hoffman, Personal communication to Bondy (1977).
34. Y. Hong, On the edge reconstruction of graphs, Ars Comb., Vol. 25, pp. 185-188 (1988).
35. P. J. Kelly, A congruence theorem for trees, Pac. J. Math., Vol. 7, pp. 961-968 (1957).
36. m-free graphs, J. Comb. Theory, Ser. B., Vol. 49, pp. 295-298 (1990).
37. I. Krasikov and Y. Roditty, Balance equations for reconstruction problems, Arch. Math., Vol. 48, No. 5, pp. 458-464 (1987).
38. I. Krasikov and Y. Roditty, Counting technique for reconstruction problems, Ars Comb., Vol. 25B, pp. 133-140 (1988).
39. I. Krasikov and Y. Roditty, Recent applications of Nash-Williams lemma to the edge reconstruction conjecture, Ars Comb., Vol. 29A, pp. 215-224 (1990).
40. I. Krasikov and Y. Roditty, Some applications of the Nash-Williams lemma to the edge reconstruction conjecture, Graphs Comb., Vol. 6, No. 1, pp. 37-39 (1990).
41. J. Lauri, Edge-reconstruction of planar graphs with minimun valency 5, J. Graph Theory, Vol. 3, No. 3, pp. 269-286 (1979).
42. J. Lauri, Graph reconstruction - Some techniques and new problems, Ars Comb., Vol. 24B, pp. 35-61 (1987).
43. J. Z. Liu and W. Zhuang, A note on the question of edge-reconstructibility of tridegree graphs, J. Qufu Norm. Univ. Nat. Sci., Vol. 20, No. 2, pp. 25-28 (1994).
44. L. Lovasz, A note on the line reconstruction problem, J. Comb. Theory, Ser. B, Vol. 13, pp. 309-310 (1972).
45. L. Lovasz, Some problems of graph theory, Matematikus Kurir (1983)
46. B. Manvel, On Reconstruction of Graphs, Ph.D. Thesis, University of Michigan (1970).
47. D. Miklos, Disproof of a conjecture in graph reconstruction theory, Combinatorica, Vol. 12, No. 3, pp. 367-369 (1992).
48. V. Mnukhin, The reconstruction of oriented necklaces, J. Comb. Inf. Syst. Sci., Vol. 20, Nos. 1-4, pp. 261-272 (1995).
49. V. Muller, The edge reconstruction hypothesis is true for graphs with more than /ilog2/i edges, J. Comb. Theory, Ser. B., Vol. 22, No. 3, pp. 281-283 (1977).
50. C. St. J. A. Nash-Williams, The reconstruction problem. Selected topics in graph theory, pp. 205-236 (1978).
51. C. St. J. A. Nash-Williams, Reconstruction of infinite graphs, Discrete Math., Vol. 95, Nos. 1-3, pp. 221-229 (1991).
52. L. Pyber, The edge reconstruction of Hamiltonian graphs, J. Graph Theory, Vol. 14, No. 2, pp. 173-179 (1990).
53. E. F. Schmeichel, A note on the edge reconstruction conjecture, Bull. Aust. Math. Soc., Vol. 12, pp. 27-30 (1975).
54. E. R. Swart, The edge reconstructibility of planar bidegree graphs, Ann. Discrete Math., Vol. 9, pp. 7-12 (1980).
55. B. D. Thatte, On a reconstruction problem, Discrete Math., Vol. 137, Nos. 1-3, pp. 387-388 (1995).
56. B. D. Thatte, On the Nash-Williams’s lemma in graph reconstruction theory, preprint, Indian Institute of Science (1990).
57. B. D. Thatte, On the Nash-William’s lemma in graph reconstruction theory, J. Comb. Theory, Ser. B., Vol. 58, pp. 280-290 (1993).
58. B. D. Thatte, Some results and approaches for reconstruction conjectures, Discrete Math., Vol. 124, Nos. 1-3, pp. 193-216 (1994).
59. C. Thomassen, Counterexamples to the edge reconstruction conjecture for infinite graphs, Discrete Math., Vol. 19, No. 3, pp. 293-295 (1976).
60. C. Thomassen, Reconstructibility versus edge reconstructibility of infinite graphs, Discrete Math., Vol. 24, No. 2, pp. 231-233 (1978).
61. A. Vince and Y. Yang, A new counting formula and its applications of edge reconstruction, Congr. Numerantium, Vol. 98, pp. 213-221 (1993).
62. Ch. Zhao, Note on the edge reconstruction of planar graphs, Ars Comb., Vol. 38, pp. 268-272 (1994).
63. Ch. Zhao, Some results on the edge reconstruction of planar graphs, J. Shandong Univ. Nat. Sci. Ed., Vol. 23, No. 3, pp. 22-26 (1988).
64. Y. Zhao, A note on the edge reconstruction conjecture, Ars Comb., Vol. 38, pp. 175-176 (1994).
65. Y. Zhao, Edge-reconstruction of minimally 3-connected planar graphs, Aequationes Math., Vol. 47, No. 1, pp. 1-10 (1994).
66. Y. Zhao, On the edge reconstruction of graphs embedded on surfaces, Graph Comb., Vol. 9, No. 4, pp. 391-395 (1993).
67. Y. Zhao, On the edge reconstruction of maximal bipartite planar graphs, Ars Comb., Vol. 35A, pp. 251-256 (1993).
68. Y. Zhao, On the edge reconstruction of 3-connected planar graphs with minimum valency 4, Discrete Math., Vol. 137, Nos. 1-3, pp. 333-344 (1995).
69. Y. Zhao, The edge reconstruction of 3-connected projective graphs with minimum valency 5, J. Comb. Math. Comb. Comput., Vol. 14, pp. 61-64 (1993).