Isomorph-free exhaustive generation

Journal of Algorithms

Volumn 26, Issue 2, 1998, Pages 306-324

  McKay, Brendan D ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001540056     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1997.0898     Document Type: Article

References (41)

1. D. Avis, Generating rooted triangulations without repetitions, Algorithmica, 16 (1996), 618-632.
2. D. Avis and K. Fukuda, Reverse search for enumeration, Discrete Appl. Math. 6 (1996), 21-46.
3. V. Batagelj, Inductive classes of cubic graphs, in "Collection: Finite and Infinite Sets" (Eger, Ed.), Colloq. Math. Soc. János Bolyai 37 (1981), 89-101.
4. S. Brandt, G. Brinkmann, and T. Harmuth, The generation of maximal triangle-free graphs, submitted for publication.
5. G. Brinkmann, Fast generation of cubic graphs, J. Graph Theory 23 (1996), 139-149.
6. G. Brinkmann, The combinatorial enumeration of hydrocarbon structures, in preparation.
7. G. Brinkmann and A. W. M. Dress, A constructive enumeration of fullerenes, J. Algorithms 23 (1997), 345-358.
8. G. Brinkmann and B. D. McKay, Fast generation of non-isomorphic planar cubic graphs, in preparation.
9. G. Brinkmann, B. D. McKay, and C. Saager, The smallest cubic graphs of girth nine, Combin. Probab. Comput. 4 (1995), 317-330.
10. 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.
11. 12, J. Combin. Des. 2 (1994), 273-285.
12. I. A. Faradzev, Generation of nonisomorphic graphs with a given degree sequence, in "Algorithmic Studies in Combinatorics," pp. 11-19, Nauka, Moscow, 1978 (in Russian).
13. I. A. Faradzev, Constructive enumeration of combinatorial objects, in "Problèmes Combinatoires et Théorie des Graphes Colloque Internat. CNRS 260," pp. 131-135, CNRS, Paris, 1978.
14. 6), J. Combin. Math. Combin. Comput. 13 (1993), 23-31.
15. P. W. Fowler, D. Mitchell, and G. Brinkmann, Electronic and Steric factors in the stability of proto-fullerene hydrocarbons, in "The Chemical Physics of the Fullerenes 10 (and 5) Years Later" (W. Andreoni, Ed.), Kluwer Academic, Dordrecht/Norwell, MA, 1995.
16. L. A. Goldberg, Efficient algorithms for listing unlabeled graphs, J. Algorithms 13 (1992), 128-143.
17. R. Grund, Konstruktion molekularer Graphen mit gegebenen Hybridisierungen und überlappungsfreien Fragmenten, Bayreuth. Math. Schr. 49 (1995), 1-113.
18. T. Grüner, R. Laue, and M. Meringer, Algorithms for group actions Homomorphism principle and orderly generation applied to graphs, preprint, 1995.
19. J. Hu, A. H. MacDonald, and B. D. McKay, Correlations in two-dimensional vortex liquids, Phys. Rev. B 149 (1994), 15263-15270.
20. A. Kerber, R. Laue, R. Hager, and W. Weber, Cataloging graphs by generating them uniformly at random, J. Graph Theory 14 (1990), 559-563.
21. D. E. Knuth, Estimating the efficiency of backtrack programs, Math. Comp. 29 (1975), 121-136.
22. G. Kolesova, C. W. H. Lam, and L. Thiel, On the number of 8 × 8 Latin squares, J. Combin. Theory Ser. A 54 (1990), 143-148.
23. B. D. McKay, Practical graph isomorphism, in "10th Manitoba Conference on Numerical Mathematics and Computing, Winnipeg, 1980," Congr. Numer. 30 (1981), 45-87.
24. B. D. McKay, "nauty User's Guide (version 1.5)," Technical Report TR-CS-90-02, Dept. Computer Science, Australian National University, 1990.
25. B. D. McKay, Small graphs are reconstructible, Australas. J. Combin. 15 (1997), 123-126.
26. B. D. McKay and S. P. Radziszowski, A new upper bound for the Ramsey number R(5, 5), Australas. J. Combin. 5 (1991), 13-20.
27. B. D. McKay and S. P. Radziszowski, The first classical Ramsey number for hypergraphs is computed, in "Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'91, San Francisco, 1991," pp. 304-308.
28. B. D. McKay and S. P. Radziszowski, There are no 4-(12,6,6) designs, in "Computational and Constructive Design Theory" (W. Wallis, Ed.), Kluwer Academic, Dordrecht/Norwell, MA, 1996.
29. B. D. McKay and S. P. Radziszowski, Towards deciding the existence of 2-(22,8,4) designs, J. Combin. Math. Combin. Comput. 22 (1996), 211-222.
30. B. D. McKay and S. P. Radziszowski, 2-(22,8,4) designs have no blocks of type 3, J. Combin. Math. Combin. Comp., to appear.
31. B. D. McKay and S. P. Radziszowski, R(4,5) = 25, J. Graph Theory 19 (1995), 309-322.
32. B. D. McKay and S. P. Radziszowski, Subgraph counting identities and Ramsey numbers, J. Combin. Theory Ser. B 69 (1997), 193-209.
33. B. D. McKay and G. F. Royle, Constructing the cubic graphs on up to 20 vertices, Ars Combin. 21A (1986), 129-140.
34. B. D. McKay and S. Sanjmyatav, Fast generation of cubic graphs by edge addition, in preparation.
35. B. D. McKay and I. M. Wanless, Most Latin squares have many subsquares, submitted for publication.
36. B. D. McKay and K. M. Zhang, The value of the Ramsey number R (3,8), J. Graph Theory 16 (1992), 99-105.
37. M. Meringer, "Erzeugung regulärer Graphen," Diplomarbeit, Universität Bayreuth, 1996.
38. R. C. Read, Every one a winner, Ann. Discrete Math. 2 (1978), 107-120.
39. P. R. Rosenbaum, Sampling the leaves of a tree with equal probabilities, J. Amer. Statist. Assoc. 88 (1993), 1455-1457.
40. G. F. Royle, An orderly algorithm and some applications in finite geometry, Discrete Math., to appear.
41. D. R. Stinson and H. Ferch, 2000000 Steiner triple systems of order 19, Math. Comp. 44 (1985), 533-535.