The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.



(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A275620 Number of (1,1,2)-chromatic cubic graphs with 2n nodes. 0


%S 0,0,2,9,42,314,2808,32766,423338,6212201

%N Number of (1,1,2)-chromatic cubic graphs with 2n nodes.

%H Nicolas Gastineau and Olivier Togni, <a href="http://arxiv.org/abs/1403.7495">S-Packing Colorings of Cubic Graphs</a>, arXiv:1403:7495 [cs.DM], 2016.

%K nonn,more

%O 2,3

%A _N. J. A. Sloane_, Aug 04 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 20 10:43 EDT 2021. Contains 348100 sequences. (Running on oeis4.)