OFFSET
1,2
COMMENTS
An undirected graph is called murky if it contains no C_5, P_6, or complement of P_6 as an induced subgraph. All murky graphs are perfect. - Falk Hüffner, Jun 30 2018
LINKS
S. Hougardy, Classes of perfect graphs, Discr. Math. 306 (2006), 2529-2571.
F. Hüffner, tinygraph, software for generating integer sequences based on graph properties, version 6c1dbe4.
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Oct 18 2006
EXTENSIONS
a(11) added using tinygraph by Falk Hüffner, Jun 30 2018
STATUS
approved