This site is supported by donations to The OEIS Foundation.
My "citations in sequences" intersects with the more recent "Revisions by Jason Kimberley". Most of those sequences relate to counting regular graphs. I have written Magma code for the Euler_transformation.
My User Subpages
Sequences to edit
Regular Graph Counting
New sequences: rows 4 to 12 (known longer than intersection with the fully known anti-diagonals) of the square array A167625.
Append terms to sequences counting regular: simple graphs A014382, A165626, A165655, A068933, A068934, A051031, A033886, A058275; multigraphs (SSSS) A129431, A005967, A129430, A129432, A129434, A129436.
Vertex labeled regular multigraphs with loops allowed (ESSS): comment that A006003 appears to also be the number of 2n-regular multigraphs on 3 vertices with loops allowed.
Make cross-references amongst sequences that list record runs in, or are subsequences of, A001221 (the number of distinct prime divisors of n): A007304, A046386, A046388, A046389, A046800, A048692, A048932, A059958, A064708, A064709, A067024, A072664, A072664, A079482, A080569, A086560, A087977, A087978, A093548, A138206, A138207, A140078, A140079, A154573. Check the results of this search and that search.
Vertex labeled regular multigraphs with loops allowed (ESSS): have corrected the definition of A005816 to be for multigraphs.
Made user subpages using the wikified versions of File:CDE Cg.zip.gz.
Other to do
Ensure that I have used the style from Style_Sheet#Style_sheet_for_contributors_to_OEIS_Wiki in my tables.
Contribute to House of Graphs the hard to compute non-cubic graphs when the number per case is small.