Circular chromatic number of Kneser graphs
From MaRDI portal
Publication:1400965
DOI10.1016/S0095-8956(03)00032-7zbMATH Open1025.05026MaRDI QIDQ1400965FDOQ1400965
Authors: Hossein Hajiabolhassan, Xuding Zhu 
Publication date: 17 August 2003
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Recommendations
Cites Work
- Kneser's conjecture, chromatic number, and homotopy
- Title not available (Why is that?)
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Star chromatic number
- Circular chromatic number: A survey
- Circular chromatic numbers of some reduced Kneser graphs
- Multichromatic numbers, star chromatic numbers and Kneser graphs
Cited In (19)
- On the multichromatic number of \(s\)-stable Kneser graphs
- On the chromatic number of general Kneser hypergraphs
- Circular chromatic numbers of some reduced Kneser graphs
- On the locating chromatic number of Kneser graphs
- Strengthening topological colorful results for graphs
- On the b-chromatic number of Kneser graphs
- On colorings of graph powers
- Local coloring of Kneser graphs
- A combinatorial proof for the circular chromatic number of Kneser graphs
- Circular coloring and Mycielski construction
- Title not available (Why is that?)
- Title not available (Why is that?)
- A generalization of Kneser's conjecture
- Resource-sharing system scheduling and circular chromatic number
- Circular chromatic Ramsey number
- Circular chromatic number of induced subgraphs of Kneser graphs
- Circular colouring and algebraic no-homomorphism theorems
- Diameters of uniform subset graphs
- A new coloring theorem of Kneser graphs
This page was built for publication: Circular chromatic number of Kneser graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1400965)
