Enumeration of bipartite graphs and bipartite blocks
From MaRDI portal
(Redirected from Publication:405245)
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3722678 (Why is no real title available?)
- scientific article; zbMATH DE number 1111371 (Why is no real title available?)
- scientific article; zbMATH DE number 6928782 (Why is no real title available?)
- scientific article; zbMATH DE number 1431596 (Why is no real title available?)
- scientific article; zbMATH DE number 3378920 (Why is no real title available?)
- scientific article; zbMATH DE number 3419161 (Why is no real title available?)
- Analytic combinatorics
- COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. I
- Enumeration of Bicolourable Graphs
- Enumeration of non-separable graphs
- Labeled Bipartite Blocks
- On the number of bi-colored graphs
- Species over a finite field
- The enumeration of bipartite graphs
- Une théorie combinatoire des séries formelles
Cited in
(13)- scientific article; zbMATH DE number 530033 (Why is no real title available?)
- scientific article; zbMATH DE number 743880 (Why is no real title available?)
- Split graphs: combinatorial species and asymptotics
- Regularity in weighted graphs a symmetric function approach
- Isomorphism classes of bipartite cycle permutation graphs
- Finding balance: split graphs and related classes
- Enumeration of point-determining graphs
- scientific article; zbMATH DE number 4158652 (Why is no real title available?)
- Enumeration of labeled bi-block graphs
- On the size of two families of unlabeled bipartite graphs
- Enumeration of bipartite self-complementary graphs
- Enumerations, forbidden subgraph characterizations, and the split-decomposition
- Counting unlabeled bipartite graphs using Polya's theorem
This page was built for publication: Enumeration of bipartite graphs and bipartite blocks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405245)