Chromatic polynomials for simplicial complexes

Publikation: Bidrag til tidsskriftTidsskriftartikelfagfællebedømt

Standard

Chromatic polynomials for simplicial complexes. / Møller, Jesper Michael; Nord, Gesche.

I: Graphs and Combinatorics, Bind 32, Nr. 2, 2016, s. 745-772.

Publikation: Bidrag til tidsskriftTidsskriftartikelfagfællebedømt

Harvard

Møller, JM & Nord, G 2016, 'Chromatic polynomials for simplicial complexes', Graphs and Combinatorics, bind 32, nr. 2, s. 745-772. https://doi.org/10.1007/s00373-015-1578-6

APA

Møller, J. M., & Nord, G. (2016). Chromatic polynomials for simplicial complexes. Graphs and Combinatorics, 32(2), 745-772. https://doi.org/10.1007/s00373-015-1578-6

Vancouver

Møller JM, Nord G. Chromatic polynomials for simplicial complexes. Graphs and Combinatorics. 2016;32(2):745-772. https://doi.org/10.1007/s00373-015-1578-6

Author

Møller, Jesper Michael ; Nord, Gesche. / Chromatic polynomials for simplicial complexes. I: Graphs and Combinatorics. 2016 ; Bind 32, Nr. 2. s. 745-772.

Bibtex

@article{58cce1b1041b421c8e31f7d166010843,
title = "Chromatic polynomials for simplicial complexes",
abstract = "In this note we consider s s -chromatic polynomials for finite simplicial complexes. When s=1 s=1 , the 1 1 -chromatic polynomial is just the usual graph chromatic polynomial of the 1 1 -skeleton. In general, the s s -chromatic polynomial depends on the s s -skeleton and its value at r r is the number of (r,s) (r,s) -colorings of the simplicial complex.",
author = "M{\o}ller, {Jesper Michael} and Gesche Nord",
year = "2016",
doi = "10.1007/s00373-015-1578-6",
language = "English",
volume = "32",
pages = "745--772",
journal = "Graphs and Combinatorics",
issn = "0911-0119",
publisher = "Springer",
number = "2",

}

RIS

TY - JOUR

T1 - Chromatic polynomials for simplicial complexes

AU - Møller, Jesper Michael

AU - Nord, Gesche

PY - 2016

Y1 - 2016

N2 - In this note we consider s s -chromatic polynomials for finite simplicial complexes. When s=1 s=1 , the 1 1 -chromatic polynomial is just the usual graph chromatic polynomial of the 1 1 -skeleton. In general, the s s -chromatic polynomial depends on the s s -skeleton and its value at r r is the number of (r,s) (r,s) -colorings of the simplicial complex.

AB - In this note we consider s s -chromatic polynomials for finite simplicial complexes. When s=1 s=1 , the 1 1 -chromatic polynomial is just the usual graph chromatic polynomial of the 1 1 -skeleton. In general, the s s -chromatic polynomial depends on the s s -skeleton and its value at r r is the number of (r,s) (r,s) -colorings of the simplicial complex.

U2 - 10.1007/s00373-015-1578-6

DO - 10.1007/s00373-015-1578-6

M3 - Journal article

VL - 32

SP - 745

EP - 772

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

SN - 0911-0119

IS - 2

ER -

ID: 135549995