The greedy algorithm is optimal for on-line edge coloring

Beomseok Nam, Henrique Andrade, et al.

ACM/IEEE SC 2006

Xiaozhu Kang, Hui Zhang, et al.

ICWS 2008

Arun Viswanathan, Nancy Feldman, et al.

IEEE Communications Magazine

G. Ramalingam

Theoretical Computer Science