Bell and Stirling numbers for disjoint unions of graphs

MaRDI QIDQ2995169zbMATH OpenFDO

Authors Bryce Duncan

Publication date 20 April 2011

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Bell and Stirling numbers (11B73) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Bell and Stirling numbers for graphs
• Stirling numbers of the second kind and Bell numbers for graphs
• Bell numbers of complete multipartite graphs
• scientific article; zbMATH DE number 7471007
• Applications of chromatic polynomials involving Stirling numbers

Cited in

(14)

• Counting the number of non-equivalent vertex colorings of a graph
• Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph
• Upper bounds on the average number of colors in the non-equivalent colorings of a graph
• scientific article; zbMATH DE number 5185602 (Why is no real title available?)
• Bell and Stirling numbers for graphs
• Applications of chromatic polynomials involving Stirling numbers
• scientific article; zbMATH DE number 7471007 (Why is no real title available?)
• Bounds on graph compositions and the connection to the Bell triangle
• Stirling numbers of the second kind and Bell numbers for graphs
• On the size of two families of unlabeled bipartite graphs
• A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\)
• Bell numbers of complete multipartite graphs
• Remarks on the Erdős-Haynal problem and on the Bell numbers
• Fubini numbers and polynomials of graphs

This page was built for publication: Bell and Stirling numbers for disjoint unions of graphs

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