|
%I #7 Oct 11 2023 23:14:51
%S 1,7,87,3503,425803,154793519
%N Number of connected series-parallel graphs with a longest path of at most n edges and also a largest cut set of at most n edges.
%D E. Detjens and G. Gannot, "Technology Mapping in MIS", Proc. 1987 IEEE Internat. Conf. Computer-Aided Design, pp. 166ff.
%K nonn,more
%O 1,2
%A michelb(AT)watson.ibm.com (Michel Berkelaar)
|
