[seqfan] Re: Can someone verify few terms of A182012 Number of graphs on 2n vertices all having odd degrees
benoit.jubin at gmail.com
Sat Apr 7 11:40:52 CEST 2012
The empty graph certainly satisfies this, so I would add a(0)=1,
following OEIS rules for the offset.
On Sat, Apr 7, 2012 at 2:26 AM, Georgi Guninski <guninski at guninski.com> wrote:
> 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.
> Seqfan Mailing list - http://list.seqfan.eu/
More information about the SeqFan