Two Results Concerning Multicoloring

DOI10.1016/S0167-5060(08)70329-7MaRDI QIDQ4152560zbMATH OpenOpenAlexFDO

Authors

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited in

(11)

• Extremal problems concerning Kneser-graphs
• On cutting-plane proofs in combinatorial optimization
• Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors
• The multichromatic numbers of some Kneser graphs
• Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope
• Channel assignment problem and n-fold t-separated L(j₁,j₂,,j_m)-labeling of graphs
• Multiple L(j,1)-labeling of the triangular lattice
• Fractional cocoloring of graphs
• Tight lower bounds for the complexity of multicoloring
• Lower bound on the maximum denominator of fractional chromatic numbers
• Multicoloring and Mycielski construction

This page was built for publication: Two Results Concerning Multicoloring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4152560)