|
| |
|
|
A123435
|
|
Number of murky graphs on n nodes.
|
|
0
|
|
|
|
1, 2, 4, 11, 33, 146, 850, 7069, 77493, 1072620, 18113560
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
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
|
Table of n, a(n) for n=1..11.
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
|
Sequence in context: A123426 A277204 A123437 * A123409 A123472 A277203
Adjacent sequences: A123432 A123433 A123434 * A123436 A123437 A123438
|
|
|
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
|
| |
|
|
