1. A. Bar-Noy, R. Motwani, and J. Naor. The greedy algorithm is optimal for on-line edge coloring. Information Processing Letters, 44(5):251–253, 1992.
2. L.A. Bassalygo and M. S. Pinsker. Complexity of an optimal nonblocking switching network without reconnections. Problems Inform. Transmission, 9:64–66, 1974.
3. L.A. Bassalygo and M. S. Pinsker. Asymptotically optimal networks for generalized rearrangeable switching and generalized switching without rearrangement. Problemy Peredachi Informatsii, 16:94–98, 1980.
4. C. Berge. Graphs and Hypergraphs. North Holland, Amsterdam, 1973.
5. L. Cai and J.A. Ellis. NP-completeness of edge-coloring some restricted graphs. Discrete Appl. Math., 30:15–27, 1991.