论文信息 - Complexité de l'arboricité linéaire d'un graphe - 字舞流文

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

G etant un graphe de degre maximal 2k, on montre que la determination de son arboricite lineaire est un probleme NP-complet pour tout k≥2 donne

B. Péroche | B. Peroche

[1] Frank Harary,et al. Covering and packing in graphs IV: Linear arboricity , 1981, Networks.

[2] Zvi Galil,et al. NP Completeness of Finding the Chromatic Index of Regular Graphs , 1983, J. Algorithms.

[3] Ian Holyer,et al. The NP-Completeness of Edge-Coloring , 1981, SIAM J. Comput..

[4] Frank Harary,et al. A formal system for information retrieval from files , 1970, Commun. ACM.

[5] Marcel Aymé,et al. A et B , 1970 .

[6] Pavel Tomasta. Note on linear arboricity , 1982 .

[7] F. Harary. COVERING AND PACKING IN GRAPHS, I. , 1970 .