Title of article

A short proof of the NP-completeness of minimum sum interval coloring

Author/Authors

D?niel Marx، نويسنده ,

Issue Information

دوماهنامه با شماره پیاپی سال 2005

Pages

3

From page

382

To page

384

Keywords

computational complexity , graph coloring , Minimum sum coloring , Chromatic sum , interval graph

Journal title

Operations Research Letters

Serial Year

2005

Journal title

Operations Research Letters

Record number

137608