A079457 - OEIS

This site is supported by donations to The OEIS Foundation.

A079457

Number of unlabeled and connected graphs which are Weakly Chordal. (G weakly chordal iff there are no induced cycles of size 5 or more in G nor in its complement.).

1, 1, 2, 6, 20, 103, 706, 7423, 116476 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,3`
	COMMENTS	`Also known as the "weakly triangulated" graphs. Contains the chordal and cochordal graphs and is contained in the class of Perfect graphs.`
	REFERENCES	`R. Hayward, Weakly triangulated graphs, Journal Comb. Theory (Series B) 39 (1985) 200-208` `R. Hayward, Generating Weakly Triangulated Graphs, Journal of Graph Theory 21 (1996) 67-69` `R. Hayward, J. Spinrad, R. Sritharan, Weakly Chordal Graph Algorithms via Handles, Proc. 11th SODA (2000) 42-49`
	CROSSREFS	`Sequence in context: A049379 A003094 A073964 * A079455 A052433 A078566` `Adjacent sequences: A079454 A079455 A079456 * A079458 A079459 A079460`
	KEYWORD	`more,nonn`
	AUTHOR	`Jim Nastos (nastos(AT)gmail.com), Jan 13 2003`

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

Last modified February 16 02:51 EST 2012. Contains 205860 sequences.