Pages that link to "Item:Q4364807"
From MaRDI portal
The following pages link to Multichromatic numbers, star chromatic numbers and Kneser graphs (Q4364807):
Displaying 19 items.
- A combinatorial proof for the circular chromatic number of Kneser graphs (Q326473) (← links)
- On the chromatic number of general Kneser hypergraphs (Q490992) (← links)
- Multicoloring and Mycielski construction (Q932681) (← links)
- Non-cover generalized Mycielski, Kneser, and Schrijver graphs (Q942096) (← links)
- Circular coloring and Mycielski construction (Q968430) (← links)
- On colorings of graph powers (Q1043947) (← links)
- Circular chromatic number of Kneser graphs (Q1400965) (← links)
- On the fractional chromatic number and the lexicographic product of graphs (Q1584257) (← links)
- Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs (Q1752619) (← links)
- Resource-sharing system scheduling and circular chromatic number (Q1770401) (← links)
- On the chromatic number of a subgraph of the Kneser graph (Q1792105) (← links)
- New results in \(t\)-tone coloring of graphs (Q1953497) (← links)
- Multiple \(L(j,1)\)-labeling of the triangular lattice (Q2015807) (← 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)
- On the Circular Chromatic Number of Graph Powers (Q2874089) (← links)
- Circular chromatic number of induced subgraphs of Kneser graphs (Q4615060) (← links)
- On the Multichromatic Number of s‐Stable Kneser Graphs (Q5265332) (← links)