Every one a winner or how to avoid isomorphism search when cataloguing combinatorial configurations

Annals of Discrete Mathematics

Volumn 2, Issue C, 1978, Pages 107-120

  Read, Ronald C ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001453807     PISSN: 01675060     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0167-5060(08)70325-X     Document Type: Article

References (10)

1. H. H. Baker, A. K. Dewdney, A. L. Szilard, Generating the nine-point graphs, Research Report # 11, Department of Computer Science, University of Western Ontario.
2. R. J. Frazer, Graduate course project, Department of Combinatorics and Optimization, University of Waterloo, unpublished (May 1973).
3. Harary, F., Palmer, E.M., Graphical Enumeration, 1973, Academic Press, New York and London.
4. Heap, B.R., The production of graphs by computer. Read, R.C., (eds.) Graph Theory and Computing, 1972, Academic Press, New York and London, 47–62.
5. Kagno, I., Linear graphs of degree less than 7 and their graphs. Am. J. Math. 68 (1946), 505–529.
6. P. McWha, Graduate course project, Department of Combinatorics and Optimization, University of Waterloo, unpublished (May 1973).
7. P. A. Morris, A catalogue of trees on n nodes, n < 14, Mathematical observations, research and other notes. Paper No. 1 StA. (Mimeographed). Publication of the Department of Mathematics, University of the West Indies.
8. R. C. Read, The production of a catalogue of digraphs on 5 nodes, Report UW1/CC1, Computing Centre, University of the West Indies.
9. Read, R.C., The coding of various kinds of unlabelled trees. Read, R.C., (eds.) Graph Theory and Computing, 1972, Academic Press, New York and London, 153–182.
10. R. C. Read, D. G. Corneil, The isomorphism disease, J. Graph Theory (to appear).