Parsimonious edge coloring, Discrete Mathematics, vol.148, issue.1-3, pp.1-7, 1996. ,
DOI : 10.1016/0012-365X(94)00254-G
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
Graphes Cubiques D'Indice Chromatique Quatre, Annals of Discrete Mathematics, vol.9, pp.23-28, 1980. ,
DOI : 10.1016/S0167-5060(08)70028-1
ContributionàContributionà l' ´ etude des graphes cubiques etprobì emes hamiltoniens dans les graphes orientés, 1981. ,
A new bound for parsimonious edge-colouring of graphs with maximum degree three, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00516702
Tools for parsi- monious edge-colouring of graphs with maximum degree three, 2012. ,
Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable, The American Mathematical Monthly, vol.82, issue.3, pp.221-239, 1975. ,
DOI : 10.2307/2319844
???ber Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre, Mathematische Annalen, vol.15, issue.4, pp.453-465, 1916. ,
DOI : 10.1007/BF01456961
Maximumk-colorable subgraphs, Journal of Graph Theory, vol.10, issue.2, pp.123-132, 1982. ,
DOI : 10.1002/jgt.3190060206
Sur quelquesprobì emes de couverture et de couplage en combinatoire, Thèse d'´ etat, 1977. ,
Approximating the maximum 3-edge-colorable subgraph problem, Discrete Mathematics, vol.309, issue.12, pp.4166-4170, 2009. ,
DOI : 10.1016/j.disc.2008.11.017
Edge deletions and the chromatic number, Ars Combin, vol.10, pp.103-106, 1980. ,
Classifications and characterizations of snarks, Discrete Mathematics, vol.188, issue.1-3, pp.183-203, 1998. ,
DOI : 10.1016/S0012-365X(97)00255-0
Measurements of edge-uncolorability, Discrete Mathematics, vol.280, issue.1-3, pp.191-214, 2004. ,
DOI : 10.1016/j.disc.2003.05.005
On an estimate of the chromatic class of a p-graph, Diskret. Analiz, vol.3, pp.25-30, 1964. ,