Search: id:A079457
Results 1-1 of 1 results found.

%I A079457
%S A079457 1,1,2,6,20,103,706,7423,116476
%N 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.).
%C A079457 Also known as the "weakly triangulated" graphs. Contains the chordal 
               and cochordal graphs and is contained in the class of Perfect graphs.
%D A079457 R. Hayward, Weakly triangulated graphs, Journal Comb. Theory (Series 
               B) 39 (1985) 200-208
%D A079457 R. Hayward, Generating Weakly Triangulated Graphs, Journal of Graph Theory 
               21 (1996) 67-69
%D A079457 R. Hayward, J. Spinrad, R. Sritharan, Weakly Chordal Graph Algorithms 
               via Handles, Proc. 11th SODA (2000) 42-49
%Y A079457 Sequence in context: A049379 A003094 A073964 this_sequence A079455 A052433 
               A078566
%Y A079457 Adjacent sequences: A079454 A079455 A079456 this_sequence A079458 A079459 
               A079460
%K A079457 more,nonn
%O A079457 1,3
%A A079457 Jim Nastos (nastos(AT)gmail.com), Jan 13 2003

Search completed in 0.001 seconds