Pages that link to "Item:Q2431265"
From MaRDI portal
The following pages link to A new coloring theorem of Kneser graphs (Q2431265):
Displaying 13 items.
- A combinatorial proof for the circular chromatic number of Kneser graphs (Q326473) (← links)
- On the chromatic number of general Kneser hypergraphs (Q490992) (← links)
- Colorful subhypergraphs in uniform hypergraphs (Q510336) (← links)
- A new lower bound for the chromatic number of general Kneser hypergraphs (Q1750225) (← links)
- On the chromatic number of a subgraph of the Kneser graph (Q1792105) (← links)
- Coloring graphs by translates in the circle (Q2033887) (← links)
- Strengthening topological colorful results for graphs (Q2359976) (← links)
- Coloring properties of categorical product of general Kneser hypergraphs (Q4615057) (← links)
- Circular chromatic number of induced subgraphs of Kneser graphs (Q4615060) (← links)
- On the Chromatic Number of Matching Kneser Graphs (Q5222567) (← links)
- On the Multichromatic Number of s‐Stable Kneser Graphs (Q5265332) (← links)
- A generalization of Kneser's conjecture (Q5891501) (← links)
- Colorings of complements of line graphs (Q6056781) (← links)
