A combinatorial proof for the circular chromatic number of Kneser graphs (Q326473): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:30, 30 January 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
