arXiv Analytics

Sign in

arXiv:1304.0139 [math.CO]AbstractReferencesReviewsResources

Enumeration of bipartite graphs and bipartite blocks

Andrew Gainer-Dewar, Ira M. Gessel

Published 2013-03-30, updated 2014-03-29Version 2

Using the theory of combinatorial species, we compute the cycle index for bipartite graphs, which we use to count unlabeled bipartite graphs and bipartite blocks.

Categories: math.CO
Subjects: 05A15, 05C30
Related articles: Most relevant | Search more
arXiv:1208.5993 [math.CO] (Published 2012-08-29, updated 2012-12-12)
Γ-species and the enumeration of k-trees
arXiv:1803.07248 [math.CO] (Published 2018-03-20)
Split graphs: combinatorial species and asymptotics
arXiv:math/9804119 [math.CO] (Published 1998-04-24, updated 1999-01-28)
Enumeration of m-ary cacti

Links

Toolbox