Laure Helme-Guizon, Yongwu Rong
Published 2004-12-13, updated 2005-10-18Version 2
For each graph we construct graded cohomology groups whose graded Euler characteristic is the chromatic polynomial of the graph. We show the cohomology groups satisfy a long exact sequence which corresponds to the well-known deletion-contraction rule. This work is motivated by Khovanov's work on categorification of the Jones polynomial of knots.
Comments: Published by Algebraic and Geometric Topology at http://www.maths.warwick.ac.uk/agt/AGTVol5/agt-5-53.abs.html
Journal: Algebr. Geom. Topol. 5 (2005) 1365-1388
On a certain representation of the chromatic polynomial
Do hypergraphs have properties on chromatic polynomials not owned by graphs
Zero-free intervals of chromatic polynomials of mixed hypergraphs
![QR code for arXiv:math/0412264 [math.CO]](http://oss.arxitics.com/images/favicon.svg)