Pages that link to "Item:Q1400965"
From MaRDI portal
The following pages link to Circular chromatic number of Kneser graphs (Q1400965):
Displaying 14 items.
- A combinatorial proof for the circular chromatic number of Kneser graphs (Q326473) (← links)
- On the chromatic number of general Kneser hypergraphs (Q490992) (← links)
- On the locating chromatic number of Kneser graphs (Q765319) (← links)
- Circular coloring and Mycielski construction (Q968430) (← links)
- Local coloring of Kneser graphs (Q998322) (← links)
- Diameters of uniform subset graphs (Q998410) (← links)
- On colorings of graph powers (Q1043947) (← links)
- Resource-sharing system scheduling and circular chromatic number (Q1770401) (← links)
- Strengthening topological colorful results for graphs (Q2359976) (← links)
- Circular colouring and algebraic no-homomorphism theorems (Q2372443) (← links)
- A new coloring theorem of Kneser graphs (Q2431265) (← links)
- Circular chromatic number of induced subgraphs of Kneser graphs (Q4615060) (← links)
- On the Multichromatic Number of s‐Stable Kneser Graphs (Q5265332) (← links)
- A generalization of Kneser's conjecture (Q5891501) (← links)
