Pages that link to "Item:Q2431265"
From MaRDI portal
The following pages link to A new coloring theorem of Kneser graphs (Q2431265):
Displaying 24 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 special case of the stahl conjecture (Q691606) (← links)
- Häggkvist-Hell graphs: A class of Kneser-colorable graphs (Q764869) (← links)
- Circular chromatic number of Kneser graphs (Q1400965) (← links)
- A note on \(b\)-coloring of Kneser graphs (Q1730264) (← links)
- A new lower bound for the chromatic number of general Kneser hypergraphs (Q1750225) (← links)
- A short proof for Chen's alternative Kneser coloring lemma (Q1758510) (← 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)
- Circular colouring and algebraic no-homomorphism theorems (Q2372443) (← links)
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs (Q2422241) (← links)
- Kőnig's edge-colouring theorem for all graphs (Q2450735) (← links)
- Colorful subgraphs in Kneser-like graphs (Q2461775) (← links)
- A topological proof of Chen's alternative Kneser coloring theorem (Q2631607) (← links)
- Almost all k-colorable graphs are easy to color (Q3811723) (← 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)
