Akiyama, Jin; Exoo, Geoffrey; Harary, Frank Covering and packing in graphs. IV: Linear arboricity. (English) Zbl 0479.05027 Networks 11, 69-72 (1981). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 6 ReviewsCited in 40 Documents MSC: 05C05 Trees Keywords:linear forest; linear arboricity Citations:Zbl 0458.05050; Zbl 0256.05115; Zbl 0226.05119 PDF BibTeX XML Cite \textit{J. Akiyama} et al., Networks 11, 69--72 (1981; Zbl 0479.05027) Full Text: DOI OpenURL References: [1] Akiyama, Math. Slovaca 30 pp 405– (1980) [2] Akiyama, Discrete Math. 27 pp 255– (1979) [3] , and , ”On covering the points of a graph with point disjoint paths,” Graph Theory and Combinatorics, R. Bari and F. Harary, Eds., Springer Lecture Notes #406 (1973) pp. 202–212. [4] Graph Theory, Addison-Wesley, Reading, MA (1969). [5] Harary, Ann. N. Y. Acad. Sci. 175 pp 198– (1970) · Zbl 0226.05119 [6] Harary, Comm. ACM 13 pp 67– (1970) [7] Nash-Williams, J. London Math. Soc. 39 pp 12– (1964) [8] ”The subgraph problem,” Advances in Graph Theory, Ed., North-Holland, Amsterdam, 1978, 289–295. · Zbl 0377.05034 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.