\(T\)-chromatic polynomials (Q1343268)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: \(T\)-chromatic polynomials |
scientific article; zbMATH DE number 716463
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(T\)-chromatic polynomials |
scientific article; zbMATH DE number 716463 |
Statements
\(T\)-chromatic polynomials (English)
0 references
1 February 1995
0 references
Let \(T_ G(\lambda)\) denote the number of \(T\)-colourings of graph \(G\) of order \(n\). The author shows that for each set \(T\) of nonnegative integers with maximal element \(r\), there is a polynomial \(Q_ G(\lambda)\) such that \(Q_ G(\lambda)= T_ G(\lambda)\) for all \(\lambda\geq r(n- 1)\).
0 references
chromatic polynomial
0 references
\(T\)-colourings
0 references
