Pages that link to "Item:Q5311915"
From MaRDI portal
The following pages link to A topological lower bound for the circular chromatic number of Schrijver graphs (Q5311915):
Displaying 11 items.
- A combinatorial proof for the circular chromatic number of Kneser graphs (Q326473) (← links)
- Colorful subhypergraphs in Kneser hypergraphs (Q405073) (← links)
- On the chromatic number of general Kneser hypergraphs (Q490992) (← links)
- Circular coloring and Mycielski construction (Q968430) (← links)
- On colorings of graph powers (Q1043947) (← links)
- On the chromatic number of a subgraph of the Kneser graph (Q1792105) (← links)
- Strengthening topological colorful results for graphs (Q2359976) (← links)
- A new coloring theorem of Kneser graphs (Q2431265) (← links)
- Colorful subgraphs in Kneser-like graphs (Q2461775) (← links)
- Circular chromatic number of induced subgraphs of Kneser graphs (Q4615060) (← links)
- On the Multichromatic Number of s‐Stable Kneser Graphs (Q5265332) (← links)
