Two Results Concerning Multicoloring
From MaRDI portal
Publication:4152560
DOI10.1016/S0167-5060(08)70329-7zbMath0374.05025OpenAlexW1511234378MaRDI QIDQ4152560
No author found.
Publication date: 1978
Published in: Algorithmic Aspects of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70329-7
Related Items (10)
On cutting-plane proofs in combinatorial optimization ⋮ Tight Lower Bounds for the Complexity of Multicoloring ⋮ Multicoloring and Mycielski construction ⋮ Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope ⋮ Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs ⋮ Multiple \(L(j,1)\)-labeling of the triangular lattice ⋮ Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors ⋮ The multichromatic numbers of some Kneser graphs ⋮ Extremal problems concerning Kneser-graphs ⋮ Fractional cocoloring of graphs
This page was built for publication: Two Results Concerning Multicoloring
