A combinatorial proof for the circular chromatic number of Kneser graphs (Q326473): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/S10878-015-9897-3 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10878-015-9897-3 / rank | |||
Normal rank | |||
Latest revision as of 14:27, 9 December 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
