R. L. Brooks, On colouring the nodes of a network, Proc. Cambridge Phil. Soc, pp.194-197, 1941.

A. Caprara and R. Rizzi, Improving a family of approximation algorithms to edge color multigraphs, Information Processing Letters, vol.68, issue.1, pp.11-15, 1998.
DOI : 10.1016/S0020-0190(98)00138-0

J. Edmonds, Maximum matching and a polyhedron with 0,1-vertices, Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, vol.69, issue.1 and 2, pp.125-130, 1965.
DOI : 10.6028/jres.069B.013

M. K. Goldberg, On multigraphs of almost maximal chromatic class, Diskret. Analiz, vol.23, pp.3-7, 1973.

P. Hall, On representation of subsets, J. Lond. Mat. Sc, vol.10, pp.26-30, 1935.

I. Holyer, The NP-Completeness of Edge-Coloring, SIAM Journal on Computing, vol.10, issue.4, pp.718-720, 1981.
DOI : 10.1137/0210055

J. Kahn, Asymptotics of the Chromatic Index for Multigraphs, Journal of Combinatorial Theory, Series B, vol.68, issue.2, pp.233-254, 1996.
DOI : 10.1006/jctb.1996.0067

J. Kahn, Asymptotics of the list-chromatic index for multigraphs. Random Structures Algorithms, pp.117-156, 2000.

P. G. Lehot, An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph, Journal of the ACM, vol.21, issue.4, pp.569-575, 1974.
DOI : 10.1145/321850.321853

M. Molloy and B. Reed, Graph Colouring and the Probabilistic Method, 2000.
DOI : 10.1007/978-3-642-04016-0

T. Nishizeki and K. Kashiwagi, On the $1.1$ Edge-Coloring of Multigraphs, SIAM Journal on Discrete Mathematics, vol.3, issue.3, pp.391-410, 1990.
DOI : 10.1137/0403035

B. Reed, ?, ?, and ?, Journal of Graph Theory, vol.27, issue.4, pp.177-212, 1998.
DOI : 10.1002/(SICI)1097-0118(199804)27:4<177::AID-JGT1>3.0.CO;2-K

P. D. Seymour, Some unsolved problems on one-factorizations of graphs, Graph Theory and Related Topics, 1979.

V. G. Vizing, On an estimate of the chromatic class of a p-graph, Diskret. Analiz, vol.3, pp.23-30, 1964.