Enumeration of bipartite graphs and bipartite blocks
classification
🧮 math.CO
keywords
bipartitegraphsblockscombinatorialcomputecountcycleenumeration
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.