@article{RO_1982__16_2_125_0, author = {Peroche, B.}, title = {Complexit\'e de l'arboricit\'e lin\'eaire d'un graphe}, journal = {RAIRO - Operations Research - Recherche Op\'erationnelle}, pages = {125--129}, publisher = {EDP-Sciences}, volume = {16}, number = {2}, year = {1982}, mrnumber = {679633}, zbl = {0492.05025}, language = {fr}, url = {http://archive.numdam.org/item/RO_1982__16_2_125_0/} }
Peroche, B. Complexité de l'arboricité linéaire d'un graphe. RAIRO - Operations Research - Recherche Opérationnelle, Volume 16 (1982) no. 2, pp. 125-129. http://archive.numdam.org/item/RO_1982__16_2_125_0/
1. Cours de D.E.A. : Graphes et Informatique, 1974-1975, Institut de Programmation, Paris-VI.
,2. The N.P, Completness of Edge-Colouring, S.I.A.M. J. of Computing, vol. 10, 1981, p. 718-720. | MR | Zbl
,3. On Partitions of Graphs in to Linear Forests and Dissections, Rapport de Recherche, n° 2 du G.R. 22 du C.N.R.S., Paris-VI, 1980.
,