[seqfan] Re: graphs with odd degrees

Georgi Guninski guninski at guninski.com
Sat Apr 7 07:58:32 CEST 2012

On Fri, Apr 06, 2012 at 06:51:43AM -0700, Tanya Khovanova wrote:
> What about even degrees. It should be there too.

A002854 		Number of Euler graphs with n nodes; number of
2-graphs with n nodes; and number of switching classes of graphs with n

A graph is an Euler graph iff every node has even degree. It need not be
connected. (Note that some web sites give a different definition of
Euler graph, and call these graphs "even" graphs.)

More information about the SeqFan mailing list