id:A124156 - OEIS Search Results

Search: id:A124156

Displaying 1-1 of 1 results found.

page 1

Thickness of complete graph K_n.

+0
2

1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15 (list; graph; listen)

	OFFSET	`1,5`
	COMMENT	`This is the minimal number of planar graphs whose union is K_n.`
	REFERENCES	`L. W. Beineke, Biplanar graphs: a survey, Computers Math. Applic., 34 (1997), 1-8.`
	LINKS	`Eric Weisstein's World of Mathematics, Graph Thickness`
	FORMULA	`Floor((n+7)/6), except a(9) = a(10) = 3.`
	CROSSREFS	`Cf. A124157-A124159.` `Sequence in context: A029835 A074280 A000523 this_sequence A072749 A066490 A156685` `Adjacent sequences: A124153 A124154 A124155 this_sequence A124157 A124158 A124159`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Dec 02 2006`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research