login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
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
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 18:49 EDT 2024. Contains 371781 sequences. (Running on oeis4.)