login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Number of cyclically 4-edge-connected cubic graphs on 2n nodes with total chromatic number 5.
0

%I #10 Jan 26 2014 12:07:23

%S 0,0,0,1,3,5,2,3,102,28,11,12,95

%N Number of cyclically 4-edge-connected cubic graphs on 2n nodes with total chromatic number 5.

%H Gunnar Brinkmann, Jan Goedgebeur, Jonas Hagglund and Klas Markstrom, <a href="http://arxiv.org/abs/1206.6690">Generation and properties of snarks</a>, arXiv:1206.6690, 2012.

%Y Cf. A175847

%K nonn,more

%O 1,5

%A _N. J. A. Sloane_, Nov 27 2012

%E Definition corrected by _Nico Van Cleemput_, Jan 26 2014