A categorification for the signed chromatic polynomial (Q2152787): Difference between revisions

Summary: By coloring a signed graph by signed colors, one obtains the signed chromatic polynomial of the signed graph. For each signed graph we construct graded cohomology groups whose graded Euler characteristic yields the signed chromatic polynomial of the signed graph. We show that the cohomology groups satisfy a long exact sequence which categorifies the signed deletion-contraction rule. This work is motivated by Helme-Guizon and Rong's construction of the categorification for the chromatic polynomial of unsigned graphs [\textit{L. Helme-Guizon} and \textit{Y. Rong}, Algebr. Geom. Topol. 5, 1365--1388 (2005; Zbl 1081.05034)].