Chromatic polynomials for simplicial complexes
Research output: Contribution to journal › Journal article › Research › peer-review
In this note we consider s s
-chromatic polynomials for finite simplicial complexes. When s=1 s=1
, the 1 1
-chromatic polynomial is just the usual graph chromatic polynomial of the 1 1
-skeleton. In general, the s s
-chromatic polynomial depends on the s s
-skeleton and its value at r r
is the number of (r,s) (r,s)
-colorings of the simplicial complex.
Original language | English |
---|---|
Journal | Graphs and Combinatorics |
Volume | 32 |
Issue number | 2 |
Pages (from-to) | 745-772 |
ISSN | 0911-0119 |
DOIs | |
Publication status | Published - 2016 |
ID: 135549995