M. O. Albertson and R. Haas, Parsimonious edge coloring, Discrete Mathematics, vol.148, issue.1-3, pp.1-7, 1996.
DOI : 10.1016/0012-365X(94)00254-G

J. A. Bondy and S. Locke, Largest bipartite subgraphs in triangle-free graphs with maximum degree three, Journal of Graph Theory, vol.10, issue.4, pp.477-504, 1986.
DOI : 10.1002/jgt.3190100407

J. Fouquet and J. Vanherpe, On parcimonious edge-colouring of graphs with maximum degree three, 2009.

J. L. Fouquet, Graphes Cubiques D'Indice Chromatique Quatre, Annals of Discrete Mathematics, vol.9, pp.23-28, 1980.
DOI : 10.1016/S0167-5060(08)70028-1

D. König and . Uber-graphen-und-ihre-anwendung-auf-determinantentheorie-un-mengenlehre, ???ber Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre, Mathematische Annalen, vol.15, issue.4, pp.453-465, 1916.
DOI : 10.1007/BF01456961

S. C. Locke, Maximumk-colorable subgraphs, Journal of Graph Theory, vol.10, issue.2, pp.123-132, 1982.
DOI : 10.1002/jgt.3190060206

R. Rizzi, Approximating the maximum 3-edge-colorable subgraph problem, Discrete Mathematics, vol.309, issue.12, pp.4166-4170, 2010.
DOI : 10.1016/j.disc.2008.11.017

W. Staton, Edge deletions and the chromatic number, Ars Combin, vol.10, pp.103-106, 1980.

E. Steffen, Measurements of edge-uncolorability, Discrete Mathematics, vol.280, issue.1-3, pp.191-214, 2004.
DOI : 10.1016/j.disc.2003.05.005