scientific article

zbMath1296.05093MaRDI QIDQ2875496

Gábor Nyul, Zsófia R. Kereskényiné Balogh

Publication date: 15 August 2014

Full work available at URL: http://ajc.maths.uq.edu.au/pdf/58/ajc_v58_p264.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

\(m\)-Fibonacci partitions\(m\)-nonconsecutive partitions

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Bell and Stirling numbers (11B73) Enumeration in graph theory (05C30)

Related Items (15)

Associated \(r\)-Dowling numbers and some relatives ⋮ 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 ⋮ Unnamed Item ⋮ Fubini numbers and polynomials of graphs ⋮ \(q\)-Stirling numbers of the second kind and \(q\)-Bell numbers for graphs ⋮ Enumerating some stable partitions involving Stirling and \(r\)-Stirling numbers of the second kind ⋮ Unnamed Item ⋮ ℱ-WORM colorings of some 2-trees: partition vectors ⋮ Sums of r-Lah numbers and r-Lah polynomials ⋮ Unnamed Item ⋮ The \(r\)-Lah numbers ⋮ Counting the number of non-equivalent vertex colorings of a graph

This page was built for publication: