A combinatorial proof for the circular chromatic number of Kneser graphs (Q326473): 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/s10878-015-9897-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2150244786 / rank | |||
Normal rank | |||
Revision as of 00:09, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A combinatorial proof for the circular chromatic number of Kneser graphs |
scientific article |
Statements
A combinatorial proof for the circular chromatic number of Kneser graphs (English)
0 references
12 October 2016
0 references
chromatic number
0 references
circular chromatic number
0 references
Kneser graphs
0 references
