A combinatorial proof for the circular chromatic number of Kneser graphs

From MaRDI portal

(Redirected from A combinatorial proof for the circular chromatic number of Kneser graphs)

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=A_combinatorial_proof_for_the_circular_chromatic_number_of_Kneser_graphs&oldid=60981924"