Pages that link to "Item:Q326473"
From MaRDI portal
The following pages link to A combinatorial proof for the circular chromatic number of Kneser graphs (Q326473):
Displaying 9 items.
- Circular chromatic number of Kneser graphs (Q1400965) (← links)
- A short proof for Chen's alternative Kneser coloring lemma (Q1758510) (← links)
- Coloring graphs by translates in the circle (Q2033887) (← links)
- On total and edge coloring some Kneser graphs (Q2168715) (← links)
- Strengthening topological colorful results for graphs (Q2359976) (← links)
- Circular colouring and algebraic no-homomorphism theorems (Q2372443) (← links)
- A topological proof of Chen's alternative Kneser coloring theorem (Q2631607) (← links)
- Circular chromatic numbers of some reduced Kneser graphs (Q3150176) (← links)
- Circular chromatic number of induced subgraphs of Kneser graphs (Q4615060) (← links)