Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #12 Jul 25 2019 04:35:56
%S 1,1,1,3,5,15,37,119,365,1258,4346,15773,58058,219016,837482,3250770,
%T 12758359,50602829
%N Number of connected (6,2)-chordal bipartite graphs on n nodes.
%C Bipartite (6,2)-chordal graphs are exactly the bipartite distance-hereditary graphs (see D'Atri and Moscarini). - _Falk Hüffner_, Jul 25 2019
%H A. D'Atri and M. Moscarini, <a href="https://doi.org/10.1137/0217032">Distance-hereditary graphs, Steiner trees, and connected domination</a>, SIAM J. Comput. 17(3) (1988), 521-538.
%H F. Hüffner, <a href="https://github.com/falk-hueffner/tinygraph">tinygraph</a>, software for generating integer sequences based on graph properties, version 9766535.
%H Jessica Shi, <a href="https://pdfs.semanticscholar.org/c264/67cd4a5f0adee094d7c19fd8a08a78b46793.pdf">Enumeration of unlabeled graph classes: A study of tree decompositions and related approaches</a>, 2015.
%Y Cf. A280765 (not necessarily connected).
%K nonn,more
%O 1,4
%A _N. J. A. Sloane_, Jan 17 2017
%E a(11)-a(18) added using tinygraph by _Falk Hüffner_, Jul 25 2019