Discrete Applied Mathematics
The complexity of chromatic strength and chromatic edge strength
Computational Complexity
Note: A note on the strength and minimum color sum of bipartite graphs
Discrete Applied Mathematics
A self-stabilizing algorithm for the minimum color sum of a graph
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Minimum sum edge colorings of multicycles
Discrete Applied Mathematics
Minimum cost edge-colorings of trees can be reduced to matchings
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
An effective heuristic algorithm for sum coloring of graphs
Computers and Operations Research
On sum edge-coloring of regular, bipartite and split graphs
Discrete Applied Mathematics
| Hi-index | 0.05 |