2014/02/04 by Maamra, Mohammed Said, Mihoubi, Miloud
#05C15 #05C69 #11B73 #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1402.0731
The chromatic polynomials are studied by several authors and have important applications in different frameworks, specially, in graph theory and enumerative combinatorics. The aim of this work is to establish some properties of the coefficients of the chromatic polynomial of a graph. Three applications on restricted Stirling numbers of the second kind are given.