Pages that link to "Item:Q1584256"
From MaRDI portal
The following pages link to The multichromatic numbers of some Kneser graphs (Q1584256):
Displaying 21 items.
- \(k\)-tuple chromatic number of the Cartesian product of graphs (Q324798) (← links)
- The achromatic number of Kneser graphs (Q510596) (← links)
- On the locating chromatic number of Kneser graphs (Q765319) (← links)
- A new class of transitive graphs (Q965970) (← links)
- On the topological lower bound for the multichromatic number (Q965996) (← links)
- A note on \(b\)-coloring of Kneser graphs (Q1730264) (← links)
- Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope (Q1751169) (← links)
- \(k\)-tuple colorings of the Cartesian product of graphs (Q1752494) (← links)
- Proof of Stahl's conjecture in some new cases (Q2197410) (← links)
- Set labelling vertices to ensure adjacency coincides with disjointness (Q2413366) (← links)
- A new coloring theorem of Kneser graphs (Q2431265) (← links)
- Covering arrays on graphs (Q2565691) (← links)
- On the circular chromatic number of graph powers (Q2874089) (← links)
- (Q3539466) (← links)
- On the chromatic number of the general Kneser-graph (Q3691691) (← links)
- Multichromatic numbers, star chromatic numbers and Kneser graphs (Q4364807) (← links)
- (Q5092401) (← links)
- On the Multichromatic Number of s‐Stable Kneser Graphs (Q5265332) (← links)
- Colorings of the Graph K ᵐ 2 + Kn (Q5859213) (← links)
- (Q5870293) (← links)
- Optimizing concurrency under Scheduling by Edge Reversal (Q6087133) (← links)