[seqfan] Can someone verify few terms of A182012 Number of graphs on 2n vertices all having odd degrees
Georgi Guninski
guninski at guninski.com
Sat Apr 7 11:26:42 CEST 2012
Trying to submit https://oeis.org/draft/A182012
A182012 Number of graphs on 2n vertices all having odd degrees
I am not familiar with graph theory and have seen too many CAS bugs.
Can someone verify some of these terms:
1, 3, 16, 243, 33120
Except for the last the computation is less than a minute.
For generating graphs one can use nauty's geng or something else.
Thanks.
--
Georgi
More information about the SeqFan
mailing list