|
%I #7 Jun 30 2018 15:21:52
%S 1,2,4,11,33,146,850,7069,77493,1072620,18113560
%N Number of murky graphs on n nodes.
%C 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
%H S. Hougardy, <a href="http://dx.doi.org/10.1016/j.disc.2006.05.021">Classes of perfect graphs</a>, Discr. Math. 306 (2006), 2529-2571.
%H F. Hüffner, <a href="https://github.com/falk-hueffner/tinygraph">tinygraph</a>, software for generating integer sequences based on graph properties, version 6c1dbe4.
%K nonn
%O 1,2
%A _N. J. A. Sloane_, Oct 18 2006
%E a(11) added using tinygraph by _Falk Hüffner_, Jun 30 2018
|
