A006713 - OEIS

This site is supported by donations to The OEIS Foundation.

A006713

Number of 3-edge-colored connected trivalent graphs with 2n nodes.
(Formerly M4310)

6, 480, 196560, 153498240, 214951968000 (list; graph; refs; listen; history; internal format)

	OFFSET	`2,1`
	REFERENCES	`R. C. Read, Some Enumeration Problems in Graph Theory. Ph.D. Dissertation, Department of Mathematics, Univ. London, 1958.` `N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).`
	CROSSREFS	`Sequence in context: A112945 A080295 A084108 * A006712 A203428 A197205` `Adjacent sequences: A006710 A006711 A006712 * A006714 A006715 A006716`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`

Content is available under The OEIS End-User License Agreement .

Last modified February 15 07:22 EST 2012. Contains 205706 sequences.