Fast Generation of Cubic Graphs

Journal of Graph Theory

Volumn 23, Issue 2, 1996, Pages 139-149

  Brinkmann, Gunnar ^a  

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0010005878     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199610)23:2<139::AID-JGT5>3.0.CO;2-U     Document Type: Article

References (23)

1. R. A. Aldred, B. D. McKay, and N. C. Wormald, Small hypohamiltonian graphs, Preprint (1994).
2. A. T. Balaban, Valence-isomerism of cyclopolyenes, Revue Roumaine de chimie 11 (1966), 1097-1116; 12 (1967), p. 103 (erratum).
3. R. A. Beezer and J. Riegsecker, Catalogs of regular graphs, Int. J. Computer Math. 51 (1994).
4. B. Bollobás, The asymptotic number of unlabelled regular graphs, J. London Math. Soc. 26 (1982), 201-206.
5. G. Brinkmann, Generating cubic graphs faster than isomorphism checking, preprint SFB 343 No. 92-047, Bielefeld (1993).
6. F. C. Bussemaker, S. Čobeljić, D. M. Cvetković, and J. J. Seidel, Computer investigation of cubic graphs," Technical Report T.H. Report 76-WSK-01, Department of Math. Technological University Eindhoven, The Netherlands (1976).
7. F. C. Bussemaker, S. Čobeljić, D. M. Cvetković, and J. J. Seidel, Cubic graphs on ≤ 14 vertices, J. Combinatorial Theory Ser. B 23 (1977), 234-235.
8. F. C. Bussemaker and J. J. Seidel, Cubical graphs of order 2n ≤ 10, T.H. Eindhoven, Note No. 10, September (1968).
9. C. J. Colburn and R. C. Read, Orderly algorithms for generating restricted classes of graphs, J. Graph Theory 3 (1979), 187-195.
10. C. J. Colburn and R. C. Read, Orderly algorithms for graph generation, Intern. J. Computer Math. 1979, Sec. A. 7 (1979), 167-172.
11. J. de Vries, Over vlakke configuraties waarin elk punt met twee lijnen incident is, Verslagen en Mededeelingen der Koninklijke Akademie voor Wetenschappen, Afdeeling Natuurkunde (3) 6 (1889), 382-407.
12. J. de Vries, Sur les configurations planes dont chaque point supporte deux droites, Rendiconti Circolo Mat. Palermo 5 (1891), 221-226.
13. I. A. Faradžev, Constructive enumeration of combinatorial objects, Colloques internationaux C.N.R.S. No260 - Problèmes Combinatoires et Théorie des Graphes, Orsay 1976, pages 131-135 (1976).
14. H. Gropp, Enumeration of regular graphs 100 years ago, Discrete Math. 101 (1992), 75-83.
15. R. Grund, Konstruktion schlichter Graphen mit gegebener Gradpartition, Bayreuther Mathematische Schriften 44 (1993), 73-104.
16. W. Imrich, Zehnpunktige kubische Graphen, Aequationes Math. 6 (1971), 6-10.
17. B. D. McKay and N. C. Wormald, Automorphisms of random graphs with specified degrees, Combinatorica 4 (1984), 325-338.
18. B. D. McKay, Isomorph free exhaustive generation. Preprint (1993).
19. B. D. McKay, NAUTY users guide. Technical Report Computer Science Technical Report TR-CS-84-05, Australian National University, (1984).
20. B. D. McKay and G. F. Royle, Constructing the cubic graphs on up to 20 vertices, Ars Combinatoria 21a (1986), 129-140.
21. A. N. Petrenjuk and L. P. Petrenjuk, On constructive enumeration of 12 vertex cubic graphs (russian), Combinatorial Analysis 3 Moscow, (1974).
22. R. C. Read, Every one a winner, Annals Discrete Math. 2 (1978), 107-120.
23. R. W. Robinson and N. C. Wormald, Numbers of cubic graphs, Journal of Graph Theory, 7 (1983), 463-467.