no. 3
Complexité de l'arboricité linéaire d'un graphe II
RAIRO - Operations Research - Recherche Opérationnelle, Tome 19 (1985) no. 3, pp. 293-300. 
@article{RO_1985__19_3_293_0,
     author = {Peroche, B.},
     title = {Complexit\'e de l'arboricit\'e lin\'eaire d'un graphe {II}},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {293--300},
     publisher = {EDP-Sciences},
     volume = {19},
     number = {3},
     year = {1985},
     mrnumber = {815871},
     zbl = {0608.05029},
     language = {fr},
     url = {http://www.numdam.org/item/RO_1985__19_3_293_0/}
}
TY  - JOUR
AU  - Peroche, B.
TI  - Complexité de l'arboricité linéaire d'un graphe II
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1985
SP  - 293
EP  - 300
VL  - 19
IS  - 3
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/RO_1985__19_3_293_0/
LA  - fr
ID  - RO_1985__19_3_293_0
ER  - 
%0 Journal Article
%A Peroche, B.
%T Complexité de l'arboricité linéaire d'un graphe II
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1985
%P 293-300
%V 19
%N 3
%I EDP-Sciences
%U http://www.numdam.org/item/RO_1985__19_3_293_0/
%G fr
%F RO_1985__19_3_293_0
Peroche, B. Complexité de l'arboricité linéaire d'un graphe II. RAIRO - Operations Research - Recherche Opérationnelle, Tome 19 (1985) no. 3, pp. 293-300. http://www.numdam.org/item/RO_1985__19_3_293_0/

1. J. Akiyama, G. Exoo et F. Harary, Covering and Packing in Graphs III: Cyclic and Acyclic Invariants, Math. Slovaca, vol. 30, 1980, p. 405-417. | MR | Zbl

2. J. Akiyama, G. Exoo et F. Harary, Covering and Packing in Graphs IV: Linear Arboricity, Networks, vol. 11, 1981, p. 69-72. | MR | Zbl

3. H. Enomoto et B. Peroche, The Linear Arboricity of Some Regular Graphs, J. Graph Theory, vol. 8, 1984, p. 309-324. | MR | Zbl

4. M. R. Garey et D. S. Johnson, Computers and Intractability, Freeman, San Francisco, 1979. | MR | Zbl

5. F. Harary, Covering and Packing in Graphs I, Ann. New York Acad. Sc, vol. 175, 1970, p. 198-205. | MR | Zbl

6. F. Harary et D. Hsaio, A Formal System for Information Eetrieval from Files, Comm. A.C.M., vol. 13, 1970 p. 67-73. | Zbl

7. I. J. Holyer, The NPcompleteness of Edge Coloring, S.I.A.M. J. Comp., vol, 10, 1981, p. 718-720. | MR | Zbl

8. D. Leven et Z. Galil, NPcompleteness of Finding the Chromatic Index of Regular Graphs, J. of Algorithms, vol. 4, 1983, p. 35-44. | MR | Zbl

9. B. Peroche, Complexité de l'arboricité linéaire d'un graphe, R.A.I.R.O. Recherche opérationnelle, vol. 16, 1982, p. 125-129. | Numdam | MR | Zbl

10. P. Tomasta, Note on Linear Arboricity, Math. Slovaca, vol. 32, 1982, p. 239-242. | MR | Zbl