Summary: On the Chromatic Polynomial of a Graph
David Avis  , Caterina De Simone y , Paolo Nobili z
June 14, 2001
Abstract
Let P (G; ) be the chromatic polynomial of a graph G with n
vertices, stability number  and clique number !. We show that for
every   n,
 n + 


 n +  1
 n + 
 

P (G;  1)
P (G; )

 !



Source: Avis, David - School of Computer Science, McGill University

Collections: Computer Technologies and Information Sciences