%I #2 Jun 29 2008 03:00:00

%S 2,4,20,173,2612,66900,2851540,201613875

%N Number of connected 2-colored graphs with n vertices and at least one edge that are minimal with respect to bisimilarity.

%H J. Behrstock and W.D. Neumann, <a href="http://arXiv.org/abs/math.GT/0604042">Quasi-isometric classification of graph manifold groups</a>

%K hard,nonn

%O 1,1

%A Walter D Neumann (neumann(AT)math.columbia.edu), Jun 30 2006