Chromatic polynomials and the symmetric group (Q1889850): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00373-003-0544-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2170055425 / rank | |||
Normal rank | |||
Revision as of 23:47, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Chromatic polynomials and the symmetric group |
scientific article |
Statements
Chromatic polynomials and the symmetric group (English)
0 references
13 December 2004
0 references
The author gives a new combinatorial interpretation of the coefficients of chromatic polynomials of graphs in terms of subsets of permutations and introduces a combinatorially defined polynomial associated to a directed graph. He proves that it is related to the chromatic polynomials. These polynomials are a specialization of the cover polynomials of digraphs. Some open questions are posed too.
0 references
linear ordering
0 references
