Recursion relations for chromatic coefficients for graphs and hypergraphs

Publikation: Bidrag til tidsskriftTidsskriftartikelfagfæ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.
OriginalsprogEngelsk
TidsskriftDiscussiones Mathematicae Graph Theory
Vol/bind42
Udgave nummer1
Sider (fra-til)101-121
DOI
StatusUdgivet - 2022

ID: 291621138