Recursion relations for chromatic coefficients for graphs and hypergraphs
Research output: Contribution to journal › Journal article › Research › peer-review
Standard
Recursion relations for chromatic coefficients for graphs and hypergraphs. / Durhuus, Bergfinnur; Lucia, Angelo.
In: Discussiones Mathematicae Graph Theory, Vol. 42, No. 1, 2022, p. 101-121.Research output: Contribution to journal › Journal article › Research › peer-review
Harvard
APA
Vancouver
Author
Bibtex
}
RIS
TY - JOUR
T1 - Recursion relations for chromatic coefficients for graphs and hypergraphs
AU - Durhuus, Bergfinnur
AU - Lucia, Angelo
PY - 2022
Y1 - 2022
N2 - 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.
AB - 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.
U2 - 10.7151/dmgt.2248
DO - 10.7151/dmgt.2248
M3 - Journal article
VL - 42
SP - 101
EP - 121
JO - Discussiones Mathematicae Graph Theory
JF - Discussiones Mathematicae Graph Theory
IS - 1
ER -
ID: 291621138