A Note on Graph Colorings and Graph Poly
โ
Noga Alon; Michael Tarsi
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 230 KB
## dedicated to professor w. t. tutte on the occasion of his eightieth birtday It is known that the chromatic number of a graph G=(V, E) with V= [1, 2, ..., n] exceeds k iff the graph polynomial f G => ij # E, i<j (x i &x j ) lies in certain ideals. We describe a short proof of this result, using