[seqfan] Re: Counting 4-connected simple cubic graphs

Douglas McNeil mcneil at hku.hk
Wed Sep 22 16:31:17 CEST 2010

> %S A000001 1,1,2,5,18,84,607
> %N A000001 Number of 4-connected simple cubic graphs on 2n vertices.

I can confirm the terms, but I admit to having been puzzled at first
about what 4-connectivity could mean on a cubic graph.


Department of Earth Sciences
University of Hong Kong

More information about the SeqFan mailing list