The enumeration of bipartite graphs

DOI10.1016/0012-365X(79)90184-5MaRDI QIDQ754226zbMATH OpenFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3231901 (Why is no real title available?)
• scientific article; zbMATH DE number 3419161 (Why is no real title available?)
• Enumeration of Bicolourable Graphs
• The Möbius function and connected graphs

Cited in

(9)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q754226)