The enumeration of bipartite graphs

DOI10.1016/0012-365X(79)90184-5zbMath0416.05049MaRDI QIDQ754226

Philip J. Hanlon

Publication date: 1979

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

generating functionenumerationbipartite graphsconnected bicolored graphsconnected bipartite graphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Related Items (9)

Enumeration of graphs with given weighted number of connected components ⋮ Enumeration of point-determining graphs ⋮ Enumeration of bipartite graphs and bipartite blocks ⋮ Enumerations, forbidden subgraph characterizations, and the split-decomposition ⋮ Finding balance: split graphs and related classes ⋮ On the barrier graph of an arrangement of ray sensors ⋮ Split graphs: combinatorial species and asymptotics ⋮ On the size of two families of unlabeled bipartite graphs ⋮ Enumeration of connected invariant graphs

Cites Work

• The Möbius function and connected graphs
• Enumeration of Bicolourable Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: The enumeration of bipartite graphs