Graph reconstruction numbers

Journal of Combinatorial Mathematics and Combinatorial Computing

Volumn 62, Issue , 2007, Pages 85-96

  McMullen, Brian ^a   Radziszowski, Stanisław P ^a  

^a Rochester Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH RECONSTRUCTION; ISOMORPHISM; RECONSTRUCTION CONJECTURE;

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL GEOMETRY; SET THEORY;

GRAPH THEORY;

EID: 70349442002     PISSN: 08353026     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (14)

1. K. J. Asciak and J. Lauri, On Disconnected Graph with Large Reconstruction Number. Ars Combinatoria, 62:173-181, 2002.
2. J. Baldwin, Graph Reconstruction Numbers, Master's Project, Department of Computer Science, Rochester Institute of Technology, 2004.
3. B. Bollobás, Almost every graph has reconstruction number three. Journal of Graph Theory, 14(1):1-4, 1990.
4. J. A. Bondy, A Graph Reconstructor's Manual. Surveys in Combinatorics, 1991 (Guildford, 1991), 221-252, London Math. Soc. Lecture Note Ser., 166, Cambridge Univ. Press, Cambridge, 1991.
5. Condor Team, University of Wisconsin-Madison, Condor Version 6.6.7 Manual, May 2004.
6. F. Haraxy and M. Plantholt, The Graph Reconstruction Number. Journal of Graph Theory, 9:451-454, 1985.
7. E. Hemaspaandra, L. Hemaspaandra, S. Radziszowski and R.Tripathi, Complexity Results in Graph Reconstruction. Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science. To appear.
8. P. J. Kelly, A congruence theorem for trees. Pacific Journal of Mathematics, 7:961-968, 1957.
9. P. J. Kelly, On Isometric Transformations. Ph.D. thesis, University of Wisconsin, 1942.
10. B. D. McKay, Small graphs are reconstructible. Australs. Journal of Combinatorics, 15:123-126, 1997.
11. B. D. McKay, Nauty User's Guide, Version 2.2 (1984-2004). Computer Science Depaxtment, Australian National University, http://cs.anu.edu.au/ ~bdm/nauty/.
12. R. Molina, Correction of a proof on the ally-reconstruction number of disconnected graphs. Ars Combinatoria, 20:59-64, 1995.
13. W. J. Myrvold, The ally reconstruction number of a disconnected graph. Ars Combinatoria, 28:123-127, 1989.
14. C. St. J. A. Nash-Williams, The Reconstruction Problem. Selected Topics in Graphs Theory, Academic Press, San Diego, 205-236, 1978.