R. E. 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, vol.157, issue.2, pp.377-386, 2009.
DOI : 10.1016/j.dam.2008.03.020

A. T. Balaban, Valence-isomerism of cyclopolyenes, Revue Roumaine de chimie, vol.11, issue.12, pp.1097-1116103, 1966.

G. Brinkmann, Fast generation of cubic graphs, Journal of Graph Theory, vol.23, issue.2, pp.139-149, 1996.
DOI : 10.1002/(SICI)1097-0118(199610)23:2<139::AID-JGT5>3.0.CO;2-U

G. Brinkmann, J. Goedgebeur, J. Hägglund, and K. Markström, Generation and properties of snarks, Journal of Combinatorial Theory, Series B, vol.103, issue.4
DOI : 10.1016/j.jctb.2013.05.001

G. Brinkmann, J. Goedgebeur, and B. D. Mckay, Homepage of snarkhunter: http://caagt

G. Brinkmann and E. Steffen, Snarks and reducibility, Ars Combinatoria, vol.50, pp.292-296, 1998.

F. C. Bussemaker, S. Cobelji´ccobelji´c, D. M. Cvetkovi´ccvetkovi´c, and J. J. Seidel, Cubic graphs on ???14 vertices, Journal of Combinatorial Theory, Series B, vol.23, issue.2-3, pp.234-235, 1977.
DOI : 10.1016/0095-8956(77)90034-X

F. C. Bussemaker and J. J. Seidel, Cubical graphs of order 2n ? 10, 1968.

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, pp.382-407, 1889.

J. De-vries, Sur les configurations planes dont chaque point supporte deux droites, Rendiconti del Circolo Matematico di Palermo, vol.5, issue.1, pp.221-226, 1891.
DOI : 10.1007/BF03015696

I. A. Farad?ev, Constructive enumeration of combinatorial objects. Colloques internationaux C, N.R.S, pp.131-135, 1976.

M. Gardner, Mathematical Games, Scientific American, vol.234, issue.4, pp.126-130, 1976.
DOI : 10.1038/scientificamerican0476-126

W. Imrich, Zehnpunktige kubische Graphen, Aequationes Mathematicae, vol.11, issue.1, pp.6-10, 1971.
DOI : 10.1007/BF01833231
URL : http://www.digizeitschriften.de/download/PPN356261603_0006/PPN356261603_0006___log8.pdf

B. D. Mckay, Practical graph isomorphism, II, 10th. Manitoba Conference on Numerical Mathematics and Computing, pp.45-87, 1980.
DOI : 10.1016/j.jsc.2013.09.003

B. D. Mckay, Isomorph-Free Exhaustive Generation, Journal of Algorithms, vol.26, issue.2, pp.306-324, 1998.
DOI : 10.1006/jagm.1997.0898

B. D. Mckay, W. Myrvold, and J. Nadon, Fast backtracking principles applied to find new cages, 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.188-191, 1998.

B. D. Mckay and G. F. Royle, Constructing the cubic graphs on up to 20 vertices, Ars Combinatoria, vol.21, pp.129-140, 1986.

B. D. Mckay and N. C. Wormald, Automorphisms of random graphs with specified vertices, Combinatorica, vol.31, issue.4, pp.325-338, 1984.
DOI : 10.1007/BF02579144

M. Meringer, Fast generation of regular graphs and construction of cages, Journal of Graph Theory, vol.9, issue.2, pp.137-146, 1999.
DOI : 10.1002/(SICI)1097-0118(199902)30:2<137::AID-JGT7>3.0.CO;2-G

A. N. Petrenjuk and L. P. Petrenjuk, On constructive enumeration of 12 vertex cubic graphs (Russian) Combinatorial analysis, 1974.

R. C. Read, Some enumeration problems in graph theory, 1958.

R. W. Robinson and N. C. Wormald, Numbers of cubic graphs, Journal of Graph Theory, vol.20, issue.4, pp.463-467, 1983.
DOI : 10.1002/jgt.3190070412

S. Sanjmyatav, Algorithms for generation of cubic graphs. Master's thesis, 2000.

N. C. Wormald, Models of Random Regular Graphs, Surveys in Combinatorics, pp.239-298, 1999.
DOI : 10.1017/CBO9780511721335.010