Chromatic polynomials for simplicial complexes

Jesper Michael Møller; Gesche Nord

doi:10.1007/s00373-015-1578-6

Chromatic polynomials for simplicial complexes

Jesper Michael Møller, Gesche Nord

Department of Mathematical Sciences

2 Citations (Scopus)

Abstract

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

Original language	English
Journal	Graphs and Combinatorics
Volume	32
Issue number	2
Pages (from-to)	745-772
ISSN	0911-0119
DOIs	https://doi.org/10.1007/s00373-015-1578-6
Publication status	Published - 1 Mar 2016

Access to Document

10.1007/s00373-015-1578-6

Cite this

@article{58cce1b1041b421c8e31f7d166010843,

title = "Chromatic polynomials for simplicial complexes",

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

author = "M{\o}ller, {Jesper Michael} and Gesche Nord",

year = "2016",

month = mar,

day = "1",

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",

}

TY - JOUR

T1 - Chromatic polynomials for simplicial complexes

AU - Møller, Jesper Michael

AU - Nord, Gesche

PY - 2016/3/1

Y1 - 2016/3/1

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

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

U2 - 10.1007/s00373-015-1578-6

DO - 10.1007/s00373-015-1578-6

M3 - Journal article

SN - 0911-0119

VL - 32

SP - 745

EP - 772

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

IS - 2

ER -

Chromatic polynomials for simplicial complexes

Abstract

Access to Document

Fingerprint

Cite this