Solving the minimum weighted integer coloring problem

DOI10.1023/A:1018370201421MaRDI QIDQ1273422zbMATH OpenOpenAlexFDO

Authors Jue Xue

Publication date 25 October 1999

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1018370201421

zbMATH Keywords

algorithmcoloring

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Solving the minimum-weighted coloring problem
• scientific article; zbMATH DE number 4144006
• scientific article; zbMATH DE number 2089998
• New lower bounds on the weighted chromatic number of a graph
• A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs

Cited in

(3)

• Solving the minimum-weighted coloring problem
• On the minimum load coloring problem
• A network-flow-based lower bound for the minimum weighted integer coloring problem

This page was built for publication: Solving the minimum weighted integer coloring problem

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