Tomasta, Pavel Note on linear arboricity. (English) Zbl 0494.05047 Math. Slovaca 32, 239-242 (1982). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 11 Documents MSC: 05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) 05C35 Extremal problems in graph theory 05C05 Trees Keywords:covering; regular graphs; linear forest PDF BibTeX XML Cite \textit{P. Tomasta}, Math. Slovaca 32, 239--242 (1982; Zbl 0494.05047) Full Text: EuDML OpenURL References: [1] AKLYAMA J., EXOO G., HARARY F.: Covering and packing in graphs III. Cyclic and acyclic invariants, Math. Slovaca 30, 1980. · Zbl 0458.05050 [2] HARARY F.: Covering and packing in graphs I. Ann. N.Y. Acad. Sci., 175, 1970, 198-205. · Zbl 0226.05119 [3] HILTON A. J. W.: Canonical edge-colourings of locally finite graphs. · Zbl 0494.05021 [4] STANTON R., COWAN D., JAMES L.: Some results on path numbers. Proc. Louisiana Conf. Combinatorics, Graph Theory and Computing, (R.C. Read Academic Press, New York 1972, 285-294. 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.