|
COMMENTS
|
Karnofsky 2004, p. 2: "Based on computations described below, the number of non-isomorphic, serial/parallel indecomposable graphs with number of edges from five through ten respectively is: 1, 5, 37, 226, 1460, 9235." These number are erroneous and the correct values given in A338487.
|