An introduction to chromatic sums
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
On chromatic sums and distributed resource allocation
Information and Computation
Minimum color sum of bipartite graphs
Journal of Algorithms
Routing with Minimum Wire Length in the Dogleg-Free Manhattan Model is $\cal NP$-Complete
SIAM Journal on Computing
Finding a Maximum Planar Subset of a Set of Nets in a Channel
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
The complexity of chromatic strength and chromatic edge strength
Computational Complexity
Sum edge coloring of multigraphs via configuration LP
ACM Transactions on Algorithms (TALG)
Max-coloring and online coloring with bandwidths on interval graphs
ACM Transactions on Algorithms (TALG)
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Layered interval codes for TCAM-based classification
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
In the minimum sum coloring problem we have to assign positive integers to the vertices of a graph in such a way that neighbors receive different numbers and the sum of the numbers is minimized. Szkalicki has shown that minimum sum coloring is NP-hard for interval graphs. Here we present a simpler proof of this result.