[seqfan] Re: Counting simple graphs with node degree >=2

Kevin Ryde user42_kevin at yahoo.com.au
Fri Sep 18 10:11:44 CEST 2015

mathar at mpia-hd.mpg.de (Richard J. Mathar) writes:
> Brendan McKay... contributed another variant in A261919 which allows
> graphs to have more than one component (to be disconnected).

A069725 "unicursal planar maps of n edges" begins 1,3,11,62 too, before
differing.  Could that be a subset, or just coincidence?

More information about the SeqFan mailing list