Generation of cubic graphs

Discrete Mathematics and Theoretical Computer Science

Volumn 13, Issue 2, 2011, Pages 69-80

  Brinkmann, Gunnar ^a   Goedgebeur, Jan ^a   McKay, Brendan D ^b  

^a GHENT UNIVERSITY   (Belgium)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

Canonical construction path; Cubic graph; Generation; Graph

Indexed keywords

CANONICAL CONSTRUCTION PATH; CUBIC GRAPH; GENERATION; GRAPH;

ALGORITHMS;

EID: 79960229377     PISSN: 14627264     EISSN: 13658050     Source Type: Journal    
DOI: None     Document Type: Article

References (25)

1. R.E.L. Aldred, G. Brinkmann, D. Van Dyck, V. Fack, and B.D. McKay. Graph structural properties of non-yutsis graphs allowing fast recognition. Discrete Applied Mathematics, 157(2):377-386, 2009.
2. A.T. Balaban. Valence-isomerism of cyclopolyenes. Revue Roumaine de chimie 11, pages 1097-1116, 1966. No. 12 (1967) p.103 (erratum).
3. G. Brinkmann. Fast generation of cubic graphs. Journal of Graph Theory, 23(2):139-149, 1996. (Pubitemid 126429299)
4. G. Brinkmann, J. Goedgebeur, J. Hägglund, and K. Markström. Generation and properties of snarks. In preparation.
5. G. Brinkmann, J. Goedgebeur, and B.D. McKay. Homepage of snarkhunter: http://caagt.ugent.be/cubic/.
6. G. Brinkmann and E. Steffen. Snarks and reducibility. Ars Combinatoria, 50:292-296, 1998. (Pubitemid 128379892)
7. F.C. Bussemaker, S. Čobeljić, D.M. Cvetković, and J.J. Seidel. Cubic graphs on ≤14 vertices. J. Combinatorial Theory Ser.B 23, pages 234-235, 1977.
8. F.C. Bussemaker and J.J. Seidel. Cubical graphs of order 2n ≤ 10. T.H. Eindhoven, Note No.10, September 1968.
9. 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, pages 382-407, 1889.
10. J. de Vries. Sur les configurations planes dont chaque point supporte deux droites. Rendiconti Circolo Mat. Palermo 5, pages 221-226, 1891.
11. 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.
12. M. Gardner. Mathematical games: Snarks, boojums and other conjectures related to the four-colormap theorem. Scientific American, 234:126-130, 1976.
13. W. Imrich. Zehnpunktige kubische Graphen. Aequationes Math.6, pages 6-10, 1971.
14. 60: Buckminsterfullerene. Nature, 318:162-163, 1985.
15. B.D. McKay. Practical graph isomorphism. In 10th. Manitoba Conference on Numerical Mathematics and Computing (Winnipeg, 1980), volume 30 of Congressus Numerantium, pages 45-87, 1981.
16. B.D. McKay. Isomorph-free exhaustive generation. Journal of Algorithms, 26:306-324, 1998. (Pubitemid 128638721)
17. B.D. McKay, W. Myrvold, and J. Nadon. Fast backtracking principles applied to find new cages. In 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 188-191, January 1998.
18. B.D. McKay and G.F. Royle. Constructing the cubic graphs on up to 20 vertices. Ars Combinatoria, 21a:129-140, 1986.
19. B.D. McKay and N.C. Wormald. Automorphisms of random graphs with specified degrees. Combinatorica, 4:325-338, 1984.
20. M. Meringer. Fast generation of regular graphs and construction of cages. Journal of Graph Theory, 30(2):137-146, 1999. (Pubitemid 129547326)
21. A.N. Petrenjuk and L.P. Petrenjuk. On constructive enumeration of 12 vertex cubic graphs (Russian). Combinatorial analysis, no.3, Moscow, 1974.
22. R.C. Read. Some enumeration problems in graph theory. Doctoral Thesis, London University, (1958).
23. R.W. Robinson and N.C. Wormald. Numbers of cubic graphs. Journal of Graph Theory, Vol. 7, pages 463-467, 1983.
24. S. Sanjmyatav. Algorithms for generation of cubic graphs. Master's thesis, Australian National University, 2000. advisor: B.D. McKay.
25. N.C. Wormald. Models of random regular graphs. In Surveys in Combinatorics, 1999, J.D. Lamb and D.A. Preece, eds, pp. 239-298.