
REFERENCES

P. Butler and R. W. Robinson, On the computer calculation of the number of nonseparable graphs, pp. 191  208 of Proc. Second Caribbean Conference Combinatorics and Computing (Bridgetown, 1977). Ed. R. C. Read and C. C. Cadogan. University of the West Indies, Cave Hill Campus, Barbados, 1977. vii+223 pp.
F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973, p. 188.
R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford, 1998.
R. W. Robinson, Enumeration of nonseparable graphs, J. Combin. Theory 9 (1970), 327356.
R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1978.
R. W. Robinson and T. R. S. Walsh, Inversion of cycle index sum relations for 2 and 3connected graphs. J. Combin. Theory Ser. B 57 (1993), no. 2, 289308.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).


LINKS

R. W. Robinson, Table of n, a(n) for n = 1..26
R. W. Robinson, Tables
R. W. Robinson and T. R. S. Walsh, Inversion of cycle index sum relations for 2 and 3connected graphs, J. Combin. Theory Ser. B. 57 (1993), 289308.
D. Stolee, Isomorphfree generation of 2connected graphs with applications, Arxiv preprint arXiv:1104.5261, 2011
Eric Weisstein's World of Mathematics, Biconnected Graph.
Eric Weisstein's World of Mathematics, kConnected Graph
