Recursion relations for chromatic coefficients for graphs and hypergraphs

Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt

Standard

Recursion relations for chromatic coefficients for graphs and hypergraphs. / Durhuus, Bergfinnur; Lucia, Angelo.

I: Discussiones Mathematicae Graph Theory, Bind 42, Nr. 1, 2022, s. 101-121.

Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt

Harvard

Durhuus, B & Lucia, A 2022, 'Recursion relations for chromatic coefficients for graphs and hypergraphs', Discussiones Mathematicae Graph Theory, bind 42, nr. 1, s. 101-121. https://doi.org/10.7151/dmgt.2248

APA

Durhuus, B., & Lucia, A. (2022). Recursion relations for chromatic coefficients for graphs and hypergraphs. Discussiones Mathematicae Graph Theory, 42(1), 101-121. https://doi.org/10.7151/dmgt.2248

Vancouver

Durhuus B, Lucia A. Recursion relations for chromatic coefficients for graphs and hypergraphs. Discussiones Mathematicae Graph Theory. 2022;42(1):101-121. https://doi.org/10.7151/dmgt.2248

Author

Durhuus, Bergfinnur ; Lucia, Angelo. / Recursion relations for chromatic coefficients for graphs and hypergraphs. I: Discussiones Mathematicae Graph Theory. 2022 ; Bind 42, Nr. 1. s. 101-121.

Bibtex

@article{9e2d7aa66a68414486c7abffd96b6707,
title = "Recursion relations for chromatic coefficients for graphs and hypergraphs",
abstract = " 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.",
author = "Bergfinnur Durhuus and Angelo Lucia",
year = "2022",
doi = "10.7151/dmgt.2248",
language = "English",
volume = "42",
pages = "101--121",
journal = "Discussiones Mathematicae Graph Theory",
number = "1",

}

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