A006823 Number of connected trivalent bipartite graphs with 2n nodes. (Formerly M1450)

1, 1, 2, 5, 13, 38, 149, 703, 4132, 29579, 245627, 2291589, 23466857, 259974248, 3087698618, 39075020582, 524492748500, 7439833931266, 111179110620163, 1745593888011626, 28726140345832290, 494406533261250407, 8881990236308687928, 166255686198172837111, 3237191621055524796848, 65467841616499410561220

Offset

3,3

References

CRC Handbook of Combinatorial Designs, 1996, p. 648.

I. A. Faradzev, Constructive enumeration of combinatorial objects, pp. 131-135 of Problèmes combinatoires et théorie des graphes (Orsay, 9-13 Juillet 1976). Colloq. Internat. du C.N.R.S., No. 260, Centre Nat. Recherche Scient., Paris, 1978.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Links

Table of n, a(n) for n=3..28.

G. Brinkmann, Fast generation of cubic graphs, Journal of Graph Theory, 23(2):139-149, 1996.

Nicolas Gastineau and Olivier Togni, S-Packing Colorings of Cubic Graphs, arXiv:1403:7495 [cs.DM], 2016.

Jan Goedgebeur and Patric R. J. Ostergard, Switching 3-Edge-Colorings of Cubic Graphs, arXiv:2105:01363 [math.CO], May 2021. See Table 2.

H. Gropp, On tactical configurations, regular bipartite graphs and (v,k,even)-designs, Discr. Math., 155 (1996), 81-98.

House of Graphs, Cubic bipartite graphs

M. Meringer, Tables of Regular Graphs

Eric Weisstein's World of Mathematics, Bicubic Graph [From Eric W. Weisstein, Jul 28 2009]

Crossrefs

Column 3 of A008326.

Cf. A006824, A008325 (Euler transform).

Sequence in context: A149859 A000800 A149860 * A319378 A151446 A239106

Adjacent sequences: A006820 A006821 A006822 * A006824 A006825 A006826

Keyword

nonn,hard,nice

Author

N. J. A. Sloane and Brendan McKay

Extensions

Terms a(17) and beyond from Andrew Howroyd, Apr 03 2020

Status

approved