Recursion relations for chromatic coefficients for graphs and hypergraphs
Publikation: Bidrag til tidsskrift › Tidsskriftartikel › fagfællebedømt
Dokumenter
- Fulltext
Indsendt manuskript, 217 KB, PDF-dokument
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 r-complete hypergraph in terms of roots of the Taylor polynomials for the exponential function.
Originalsprog | Engelsk |
---|---|
Tidsskrift | Discussiones Mathematicae Graph Theory |
Vol/bind | 42 |
Udgave nummer | 1 |
Sider (fra-til) | 101-121 |
DOI | |
Status | Udgivet - 2022 |
ID: 291621138