Abstract
Phil Hanlon proved that the coefficients of the chromatic polynomial of a graph G are equal (up to sign) to the dimensions of the summands in a Hodge-type decomposition of the top homology of the coloring complex for G. We prove a type B analogue of this result for chromatic polynomials of signed graphs using hyperocta- hedral Eulerian idempotents.
Original language | English |
---|---|
Article number | P2.35 |
Journal | Electronic Journal of Combinatorics |
Volume | 21 |
Issue number | 2 |
DOIs | |
State | Published - May 22 2014 |
Keywords
- Chromatic polynomial
- Coloring complex
- Eulerian idempotent
- Hodge decomposition
- Signed graph
ASJC Scopus subject areas
- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
- Applied Mathematics