Complexité de l'arboricité linéaire d'un graphe II

B. Peroche

RAIRO - Operations Research - Recherche Opérationnelle (1985)

  • Volume: 19, Issue: 3, page 293-300
  • ISSN: 0399-0559

How to cite

top

Peroche, B.. "Complexité de l'arboricité linéaire d'un graphe II." RAIRO - Operations Research - Recherche Opérationnelle 19.3 (1985): 293-300. <http://eudml.org/doc/104885>.

@article{Peroche1985,
author = {Peroche, B.},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {linear arboricity; NP completeness},
language = {fre},
number = {3},
pages = {293-300},
publisher = {EDP-Sciences},
title = {Complexité de l'arboricité linéaire d'un graphe II},
url = {http://eudml.org/doc/104885},
volume = {19},
year = {1985},
}

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
PB - EDP-Sciences
VL - 19
IS - 3
SP - 293
EP - 300
LA - fre
KW - linear arboricity; NP completeness
UR - http://eudml.org/doc/104885
ER -

References

top
  1. 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. Zbl0458.05050MR595302
  2. 2. J. AKIYAMA, G. EXOO et F. HARARY, Covering and Packing in Graphs IV: Linear Arboricity, Networks, vol. 11, 1981, p. 69-72. Zbl0479.05027MR608921
  3. 3. H. ENOMOTO et B. PEROCHE, The Linear Arboricity of Some Regular Graphs, J. Graph Theory, vol. 8, 1984, p. 309-324. Zbl0581.05017MR742883
  4. 4. M. R. GAREY et D. S. JOHNSON, Computers and Intractability, Freeman, San Francisco, 1979. Zbl0411.68039MR519066
  5. 5. F. HARARY, Covering and Packing in Graphs I, Ann. New York Acad. Sc, vol. 175, 1970, p. 198-205. Zbl0226.05119MR263677
  6. 6. F. HARARY et D. HSAIO, A Formal System for Information Eetrieval from Files, Comm. A.C.M., vol. 13, 1970 p. 67-73. Zbl0185.43601
  7. 7. I. J. HOLYER, The NPcompleteness of Edge Coloring, S.I.A.M. J. Comp., vol, 10, 1981, p. 718-720. Zbl0473.68034MR635430
  8. 8. D. LEVEN et Z. GALIL, NPcompleteness of Finding the Chromatic Index of Regular Graphs, J. of Algorithms, vol. 4, 1983, p. 35-44. Zbl0509.68037MR689264
  9. 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. Zbl0492.05025MR679633
  10. 10. P. TOMASTA, Note on Linear Arboricity, Math. Slovaca, vol. 32, 1982, p. 239-242. Zbl0494.05047MR669999

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.