|
|
A123422
|
|
Number of elementary graphs on n nodes.
|
|
0
|
|
|
1, 2, 4, 10, 25, 79, 253, 936, 3601, 15486, 74413, 441436, 3505441, 40309116, 670660262
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
A graph is called elementary if its edges can be colored with two colors such that no monochromatic induced P_3 occurs. Elementary graphs are perfect. - Falk Hüffner, Jun 30 2018
|
|
LINKS
|
F. Hüffner, tinygraph, software for generating integer sequences based on graph properties, version 6c1dbe4.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
a(11)-a(15) added using tinygraph by Falk Hüffner, Jun 30 2018
|
|
STATUS
|
approved
|
|
|
|