THE USE OF THE CHROMATIC POLYNOMIAL OF A GRAPH IN ENUMERATIVE COMBINATORICS

  • CORNEL BERCEANU
    Vasile Alecsandri" University of Bacău, Faculty of Sciences, Department of Mathe-matics, Informatics and Educational Sciences, Calea Mărăşeşti 157, Bacău 600115, Romania
    cornel_berceanu@yahoo.com

Abstract

The chromatic polynomial of a graph on the set N={1,2,...,n} is used as an instrument to find the number of possible partitions of N under some particular restraints and the number of functions on N with special properties.

Cuvinte cheie

Partition Bell number Stirling's numbers graph chromatic polynomial