Circular chromatic number of Kneser graphs

DOI10.1016/S0095-8956(03)00032-7zbMath1025.05026MaRDI QIDQ1400965

Hossein Hajiabolhassan, Xuding Zhu

Publication date: 17 August 2003

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (14)

Strengthening topological colorful results for graphs ⋮ Circular colouring and algebraic no-homomorphism theorems ⋮ A combinatorial proof for the circular chromatic number of Kneser graphs ⋮ A new coloring theorem of Kneser graphs ⋮ Circular chromatic number of induced subgraphs of Kneser graphs ⋮ A generalization of Kneser's conjecture ⋮ On the chromatic number of general Kneser hypergraphs ⋮ Circular coloring and Mycielski construction ⋮ Resource-sharing system scheduling and circular chromatic number ⋮ Local coloring of Kneser graphs ⋮ Diameters of uniform subset graphs ⋮ On the locating chromatic number of Kneser graphs ⋮ On colorings of graph powers ⋮ On the Multichromatic Number of s‐Stable Kneser Graphs

Cites Work

• Unnamed Item
• Kneser's conjecture, chromatic number, and homotopy
• Circular chromatic numbers of some reduced Kneser graphs
• Star chromatic number
• Multichromatic numbers, star chromatic numbers and Kneser graphs
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Circular chromatic number: A survey

This page was built for publication: Circular chromatic number of Kneser graphs