The problem of maximizing the possible number of users of a packet radio network with time division multiplexing, when the number of slots per time frame and the maximum communication delay between users are given, can be modeled by a graph. In this paper, a new way of edge-coloring is presented on several families of large graphs on alphabets. This method allows us to obtain a certain improvement of the previous results.