|
Search: id:A079573
|
|
|
| A079573 |
|
Number of unlabeled, connected graphs on n vertices with no induced subgraph isomorphic to a diamond, where a diamond is the graph on four vertices formed by removing an edge from the complete graph K4. |
|
+0
1
|
| |
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
A. Brandstadt (P5,diamond)-free graphs Revisited: Structure and Linear Time optimization, in Optimal discrete structures and algorithms (ODSA 2000). Discrete Appl. Math. 138 (2004), 13-27.
|
|
CROSSREFS
|
Sequence in context: A149875 A085632 A111563 this_sequence A067021 A098716 A082938
Adjacent sequences: A079570 A079571 A079572 this_sequence A079574 A079575 A079576
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Jim Nastos (nastos(AT)gmail.com), Jan 24 2003
|
|
|
Search completed in 0.002 seconds
|
