Enumeration of bipartite graphs and bipartite blocks

zbMath1300.05129arXiv1304.0139MaRDI QIDQ405245

Ira M. Gessel, Andrew Gainer-Dewar

Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.0139

zbMATH Keywords

cycle indexcombinatorial speciesunlabeled bipartite graphs and blocks

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Group actions on combinatorial structures (05E18)

Related Items (5)

Regularity in Weighted Graphs: A Symmetric Function Approach ⋮ Enumerations, forbidden subgraph characterizations, and the split-decomposition ⋮ Finding balance: split graphs and related classes ⋮ Split graphs: combinatorial species and asymptotics ⋮ On the size of two families of unlabeled bipartite graphs

Cites Work

• The enumeration of bipartite graphs
• On the number of bi-colored graphs
• Une théorie combinatoire des séries formelles
• Species over a finite field
• COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. I
• Enumeration of Bicolourable Graphs
• Labeled Bipartite Blocks
• Enumeration of non-separable graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Enumeration of bipartite graphs and bipartite blocks