scientific article
From MaRDI portal
Publication:3550089
zbMath1213.05191MaRDI QIDQ3550089
Publication date: 30 March 2010
Full work available at URL: https://eudml.org/doc/232537
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
matroidchromatic polynomialTutte polynomialsimple graphstable partitiongraphical Bell numbergraphical Stirling number
Exact enumeration problems, generating functions (05A15) Bell and Stirling numbers (11B73) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (20)
Recent developments in combinatorial aspects of normal ordering ⋮ On the real roots of \(\sigma\)-polynomials ⋮ Walks, partitions, and normal ordering ⋮ A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\) ⋮ Upper bounds on the average number of colors in the non-equivalent colorings of a graph ⋮ Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph ⋮ Ranking trees based on global centrality measures ⋮ Note on some restricted Stirling numbers of the second kind ⋮ K-regular decomposable incidence structure of maximum degree ⋮ Unnamed Item ⋮ Fubini numbers and polynomials of graphs ⋮ \(q\)-Stirling numbers of the second kind and \(q\)-Bell numbers for graphs ⋮ Restricted \(r\)-Stirling numbers and their combinatorial applications ⋮ Enumerating some stable partitions involving Stirling and \(r\)-Stirling numbers of the second kind ⋮ On the Roots of σ-Polynomials ⋮ Total non-negativity of some combinatorial matrices ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Path decompositions of digraphs and their applications to Weyl algebra ⋮ Counting the number of non-equivalent vertex colorings of a graph
Uses Software
This page was built for publication:
