Peroche, B. Complexité de l’arboricité linéaire d’un graphe. (French) Zbl 0492.05025 RAIRO, Rech. Opér. 16, 125-129 (1982). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 ReviewCited in 10 Documents MSC: 05C05 Trees 03D15 Complexity of computation (including implicit computational complexity) Keywords:linear arboricity; N.P.-complexity; chains forests PDF BibTeX XML Cite \textit{B. Peroche}, RAIRO, Rech. Opér. 16, 125--129 (1982; Zbl 0492.05025) Full Text: DOI EuDML OpenURL