Unfortunately, the graph coloring problem is nearly impossible to answer in full generality. But after decades of effort, a team of mathematicians has managed to characterize one major class of ...

A theorem for coloring a large class of “perfect” mathematical networks could ease the way for a long-sought general coloring proof.

A graph coloring problem starts with a graph -- a visual representation of a set of objects connected in some way. To solve the problem, each object must be assigned a color, but two objects ...

The radio channel assignment problem can be cast as a graph coloring problem. Vertices correspond to transmitter locations and their labels (colors) to radio channels. The assignment of frequencies to ...

Bhaswar B. Bhattacharya, COLLISION TIMES IN MULTICOLOR URN MODELS AND SEQUENTIAL GRAPH COLORING WITH APPLICATIONS TO DISCRETE LOGARITHMS, The Annals of Applied Probability, Vol. 26, No. 6 (December ...