M. O. Albertson, You Can't Paint Yourself into a Corner, Journal of Combinatorial Theory, Series B, vol.73, issue.2, pp.189-194, 1998.
DOI : 10.1006/jctb.1998.1827

M. O. Albertson, A. V. Kostochka, and D. B. West, Precoloring Extensions of Brooks' Theorem, SIAM Journal on Discrete Mathematics, vol.18, issue.3, pp.542-55305, 2004.
DOI : 10.1137/S0895480103425942

M. O. Albertson and E. H. Moore, Extending graph colorings using no extra colors, Discrete Mathematics, vol.234, issue.1-3, pp.125-132, 2001.
DOI : 10.1016/S0012-365X(00)00376-9

N. Alon, Restricted colorings of graphs, Surveys in Combinatorics, pp.1-33, 1993.
DOI : 10.1017/CBO9780511662089.002

R. P. Anstee and J. R. Griggs, An application of matching theory of edge-colourings, Discrete Mathematics, vol.156, issue.1-3, pp.253-256, 1996.
DOI : 10.1016/0012-365X(96)89437-4

M. Axenovich, A note on graph coloring extensions and list-colorings, Electron. J. Combin, vol.10, issue.5, p.pp, 2003.

C. Berge and J. Fournier, A short proof for a generalization of Vizing's theorem, Journal of Graph Theory, vol.3, issue.3, pp.333-336, 1991.
DOI : 10.1002/jgt.3190150309

M. Bonamy, Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable, SIAM Journal on Discrete Mathematics, vol.29, issue.3, pp.1735-1763, 2015.
DOI : 10.1137/130927449
URL : https://hal.archives-ouvertes.fr/lirmm-01264429

O. V. Borodin, Criterion of chromaticity of a degree prescription (in Russian), Abstracts of IV All-Union Conf. on Theoretical Cybernetics (Novosibirsk), pp.127-128, 1977.

O. V. Borodin, A generalization of Kotzig's theorem and prescribed edge coloring of planar graphs, Math. Notes, vol.48, pp.5-61186, 1990.

O. V. Borodin, A. V. Kostochka, and D. R. Woodall, List Edge and List Total Colourings of Multigraphs, Journal of Combinatorial Theory, Series B, vol.71, issue.2, pp.184-204, 1997.
DOI : 10.1006/jctb.1997.1780

N. Cohen and F. Havet, Planar graphs with maximum degree ? ? 9 are (? + 1)-edge- choosable?a short proof, Discrete Math, issue.21, pp.3103049-3051, 2010.
URL : https://hal.archives-ouvertes.fr/hal-01338378

E. Csóka, G. Lippner, and O. Pikhurko, K? onig's line coloring and vizing's theorems for graphings. arXiv:1408, p.2014, 1973.

P. Erd?-os, A. L. Rubin, and H. Taylor, Choosability in graphs, Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing, pp.125-157, 1979.

T. Gallai, Kritische Graphen. I. Magyar Tud, Akad. Mat. Kutató Int. Közl, vol.8, pp.165-192, 1963.

F. Galvin, The List Chromatic Index of a Bipartite Multigraph, Journal of Combinatorial Theory, Series B, vol.63, issue.1, pp.153-158, 1995.
DOI : 10.1006/jctb.1995.1011

R. P. Gupta, On decompositions of a multi-graph into spanning subgraphs, Bulletin of the American Mathematical Society, vol.80, issue.3, pp.500-502, 1974.
DOI : 10.1090/S0002-9904-1974-13468-3

R. Häggkvist and J. Janssen, New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs, Combinatorics, Probability and Computing, vol.6, issue.3, pp.295-313, 1997.
DOI : 10.1017/S0963548397002927

M. Juvan, B. Mohar, and R. Skrekovski, On list edge-colorings of subcubic graphs, Discrete Mathematics, vol.187, issue.1-3
DOI : 10.1016/S0012-365X(97)00230-6

M. Juvan, B. Mohar, and R. Skrekovski, Graphs of degree 4 are 5-edge-choosable, Journal of Graph Theory, vol.69, issue.3, pp.250-264, 1999.
DOI : 10.1002/(SICI)1097-0118(199911)32:3<250::AID-JGT5>3.0.CO;2-R

J. Kahn, Asymptotically Good List-Colorings, Journal of Combinatorial Theory, Series A, vol.73, issue.1, pp.1-59, 1996.
DOI : 10.1006/jcta.1996.0001

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.

O. Marcotte and P. Seymour, Extending an edge-coloring, Journal of Graph Theory, vol.38, issue.5, pp.565-573, 1990.
DOI : 10.1002/jgt.3190140508

M. Molloy and B. Reed, Near-optimal list colorings. Random Structures Algorithms, pp.376-402, 2000.

M. Molloy and B. Reed, Graph Colouring and the Probabilistic Method, volume 23 of Algorithms and Combinatorics, 2002.

D. P. Sanders and Y. Zhao, Planar Graphs of Maximum Degree Seven are Class I, Journal of Combinatorial Theory, Series B, vol.83, issue.2, pp.201-212, 2001.
DOI : 10.1006/jctb.2001.2047

D. Scheide and M. Stiebitz, On Vizing???s bound for the chromatic index of a multigraph, Discrete Mathematics, vol.309, issue.15, pp.4920-4925, 2009.
DOI : 10.1016/j.disc.2008.04.046

P. D. Seymour, On multicolourings of cubic graphs, and conjectures of Fulkerson and Tutte, Proc. London Math. Soc. (3), pp.423-460, 1979.

C. E. Shannon, A Theorem on Coloring the Lines of a Network, Journal of Mathematics and Physics, vol.28, issue.1-4, pp.148-151, 1949.
DOI : 10.1002/sapm1949281148

M. Stiebitz, D. Scheide, B. Toft, and L. M. Favrholdt, Graph Edge Coloring. Vizing's Theorem and Goldberg's Conjecture. Wiley Series in Discrete Mathematics and Optimization, 2012.

C. Thomassen, Every Planar Graph Is 5-Choosable, Journal of Combinatorial Theory, Series B, vol.62, issue.1, pp.180-181, 1994.
DOI : 10.1006/jctb.1994.1062

C. Thomassen, Color-Critical Graphs on a Fixed Surface, Journal of Combinatorial Theory, Series B, vol.70, issue.1, pp.67-100, 1997.
DOI : 10.1006/jctb.1996.1722

V. G. Vizing, On an estimate of the chromatic class of a p-graph (in Russian), Diskret. Analiz, vol.3, pp.25-30, 1964.

V. G. Vizing, Critical graphs with given chromatic class (in Russian), Diskret. Analiz, vol.5, pp.9-17, 1965.

V. G. Vizing, Coloring the vertices of a graph in prescribed colors (in Russian), Diskret. Analiz, vol.29, issue.101, pp.3-10, 1976.