Recursion relations for chromatic coefficients for graphs and hypergraphs
Research output: Contribution to journal › Journal article › Research › peer-review
Documents
- Fulltext
Submitted manuscript, 217 KB, PDF document
We establish a set of recursion relations for the coefficients in the chromatic polynomial of a graph or a hypergraph. As an application we provide a generalization of Whitney's broken cycle theorem for hypergraphs, as well as deriving an explicit formula for the linear coefficient of the chromatic polynomial of the -complete hypergraph in terms of roots of the Taylor polynomials for the exponential function.
Original language | English |
---|---|
Journal | Discussiones Mathematicae Graph Theory |
Volume | 42 |
Issue number | 1 |
Pages (from-to) | 101-121 |
DOIs | |
Publication status | Published - 2022 |
ID: 291621138