The enumeration of bipartite graphs

DOI10.1016/0012-365X(79)90184-5zbMATH Open0416.05049MaRDI QIDQ754226FDOQ754226

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Enumeration of Bicolourable Graphs
• The Möbius function and connected graphs

Cited In (9)

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

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)