# Split graph into groups of edges that are not adjacent

I need to split graph, another say to color it into some groups of unadjacent edges.

Minimize number of groups is not the only goal to achive. Group of every size has its's own weight, e.g. 64 - 1, 128 - 1.5, 256 - 1.8 and so on. If we have got some groups then weight of coloring is the weight of its biggest component. And i need somehow to minimize $NumOfGroups * WeightOfColoring$.

I'm not very strong in graph theory, but it would be good if you direct me to a good article or give me a good hint.

-
This www2.research.att.com/~yifanhu/PROJECT/schedule/node2.html may give you good hints and some references also I think. –  wece Jul 24 '13 at 15:29