id:A006712 - OEIS Search Results

Search: id:A006712

Displaying 1-1 of 1 results found.

page 1

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

+0
1

6, 480, 197820, 154103040, 215643443400 (list; graph; listen)

	OFFSET	`2,1`
	REFERENCES	`R. C. Read, Some Enumeration Problems in Graph Theory. Ph.D. Dissertation, Department of Mathematics, Univ. London, 1958.`
	CROSSREFS	`Adjacent sequences: A006709 A006710 A006711 this_sequence A006713 A006714 A006715` `Sequence in context: A080295 A084108 A006713 this_sequence A099057 A123278 A127605`
	KEYWORD	`nonn`
	AUTHOR	`njas`

page 1

Search completed in 0.002 seconds

Last modified May 16 01:24 EDT 2008. Contains 139630 sequences.