Small graphs are reconstructible

Australasian Journal of Combinatorics

Volumn 15, Issue , 1997, Pages 123-126

  McKay, Brendan D ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042750653     PISSN: 10344942     EISSN: 22023518     Source Type: Journal    
DOI: None     Document Type: Article

References (8)

1. J. A. Bondy, A graph reconstructor's manual, in "Surveys in Combinatorics, 1991", (Guildford, 1991), London Math. Soc. Lecture Note Ser. 166, Cambridge Univ. Press, Cambridge (1991) 221-252.
2. J. A. Bondy and R. L. Hemminger, Graph reconstruction-a survey, J. Graph Theory, 1 (1977) 227-268.
3. R. D. Cameron, C. J. Colbourn, R. C. Read and N. C. Wormald, Cataloguing the graphs on 10 vertices, J. Graph Theory, 9 (1985) 551-562.
4. F. Harary, On the reconstruction of a graph from a collection of subgraphs, in "Theory of graphs and its applications", Academic Press, NY (1964) 47-52.
5. B. Manvel, Reconstruction of graphs: progress and prospects, 250th Anniversary Conference on Graph Theory (Fort Wayne, IN, 1986), Congressus Numerantium 63 (1988) 177-187.
6. B. D. McKay, Computer reconstruction of small graphs, J. Graph Theory, 1 (1977) 281-283.
7. B. D. McKay, nauty User's Guide (version 1. 5), Tech. Rpt. TR-CS-90-02, Dept. Computer Science, Austral. Nat. Univ. (1990).
8. B. D. McKay, Isomorph-free exhaustive generation, submitted.