Circular chromatic numbers of some reduced Kneser graphs

DOI10.1002/jgt.10052zbMath0996.05049OpenAlexW4237564820MaRDI QIDQ3150176

Ko-Wei Lih, Daphne Der-Fen Liu

Publication date: 29 September 2002

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10052

zbMATH Keywords

circular chromatic numberreduced Kneser graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (7)

A combinatorial proof for the circular chromatic number of Kneser graphs ⋮ Circular chromatic number of Kneser graphs ⋮ A new coloring theorem of Kneser graphs ⋮ Circular chromatic number of induced subgraphs of Kneser graphs ⋮ Diameters of uniform subset graphs ⋮ On colorings of graph powers ⋮ On the Multichromatic Number of s‐Stable Kneser Graphs

Cites Work

• Circular chromatic number and Mycielski graphs

This page was built for publication: Circular chromatic numbers of some reduced Kneser graphs