\(T\)-chromatic polynomials (Q1343268): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q587976 |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Jozef Fiamčik / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4040797 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An introduction to chromatic polynomials / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: \(T\)-colorings of graphs: recent results and open problems / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(93)e0089-m / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2028027692 / rank | |||
Normal rank | |||
Latest revision as of 11:03, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(T\)-chromatic polynomials |
scientific article |
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
