Computing lower bounds for minimum sum coloring and optimum cost chromatic partition

DOI10.1016/j.cor.2019.05.010zbMath1458.05078OpenAlexW2944824120WikidataQ127939068 ScholiaQ127939068MaRDI QIDQ2003584

Yanyan Li

Publication date: 9 July 2019

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2019.05.010

zbMATH Keywords

graph coloringlower boundsgraph algorithmsminimum sum coloringoptimum cost chromatic partition

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

A branch-and-price algorithm for the minimum sum coloring problem

Uses Software

• EXTRACOL
• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A memetic algorithm for the minimum sum coloring problem
• Improving the extraction and expansion method for large graph coloring
• A note on the strength and minimum color sum of bipartite graphs
• On a graph partition problem with application to VLSI layout
• On chromatic sums and distributed resource allocation
• Hybrid evolutionary search for the minimum sum coloring problem of graphs
• Coloring large graphs based on independent set extraction
• An effective heuristic algorithm for sum coloring of graphs
• On sum coloring of graphs
• Minimum Sum Coloring of P4-sparse graphs
• Lower Bounds for the Minimal Sum Coloring Problem
• Incremental Upper Bound for the Maximum Clique Problem
• Recent Advances in Constraints

This page was built for publication: Computing lower bounds for minimum sum coloring and optimum cost chromatic partition