A006712 - OEIS

This site is supported by donations to The OEIS Foundation.

A006712

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

6, 480, 197820, 154103040, 215643443400 (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: A080295 A084108 A006713 * A203428 A197205 A197803` `Adjacent sequences: A006709 A006710 A006711 * A006713 A006714 A006715`
	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 16 04:47 EST 2012. Contains 205860 sequences.