Pages that link to "Item:Q4152560"
From MaRDI portal
The following pages link to Two Results Concerning Multicoloring (Q4152560):
Displaying 10 items.
- Multicoloring and Mycielski construction (Q932681) (← links)
- Extremal problems concerning Kneser-graphs (Q1057858) (← links)
- On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
- Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors (Q1278299) (← links)
- The multichromatic numbers of some Kneser graphs (Q1584256) (← links)
- Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope (Q1751169) (← links)
- Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs (Q1752619) (← links)
- Multiple \(L(j,1)\)-labeling of the triangular lattice (Q2015807) (← links)
- Fractional cocoloring of graphs (Q2117529) (← links)
- Tight Lower Bounds for the Complexity of Multicoloring (Q5111704) (← links)
