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

B. Peroche

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

  • Volume: 16, Issue: 2, page 125-129
  • ISSN: 0399-0559

How to cite

top

Peroche, B.. "Complexité de l'arboricité linéaire d'un graphe." RAIRO - Operations Research - Recherche Opérationnelle 16.2 (1982): 125-129. <http://eudml.org/doc/104805>.

@article{Peroche1982,
author = {Peroche, B.},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {linear arboricity; N.P.-complexity; chains forests},
language = {fre},
number = {2},
pages = {125-129},
publisher = {EDP-Sciences},
title = {Complexité de l'arboricité linéaire d'un graphe},
url = {http://eudml.org/doc/104805},
volume = {16},
year = {1982},
}

TY - JOUR
AU - Peroche, B.
TI - Complexité de l'arboricité linéaire d'un graphe
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1982
PB - EDP-Sciences
VL - 16
IS - 2
SP - 125
EP - 129
LA - fre
KW - linear arboricity; N.P.-complexity; chains forests
UR - http://eudml.org/doc/104805
ER -

References

top
  1. 1. M. CHEIN, Cours de D.E.A. : Graphes et Informatique, 1974-1975, Institut de Programmation, Paris-VI. 
  2. 2. J. HOLYER, The N.P, Completness of Edge-Colouring, S.I.A.M. J. of Computing, vol. 10, 1981, p. 718-720. Zbl0473.68034MR635430
  3. 3. B. PEROCHE, 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. 

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.