Graph Colorings and Acyclic Orientations

This paper presents new combinatorial proofs of two identities due to R. Stanley relating the chromatic polynomial acyclic orientations of a graph. In addition, using elementary means, explicit formulae for the generating functions of the chromatic numbers and the number of color compatible acyclic orientations ate derived. These formulae immediately shows a reciprocity law concerning the generating functions.