

A198634


Number of weakly perfect graphs on n nodes.


4



1, 2, 4, 11, 33, 152, 1006, 11805, 257542, 11011758, 917095022, 145164791300
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

A graph is weakly perfect if it has equal chromatic and clique numbers.
First differs from A287007 (fractional chromatic number equals chromatic number) at a(8).  Eric W. Weisstein, May 17 2017


LINKS

F. Hüffner, tinygraph, software for generating integer sequences based on graph properties, version 4361e42


FORMULA



CROSSREFS



KEYWORD

nonn,more


AUTHOR



EXTENSIONS



STATUS

approved



