Some results on linear arboricity. (English) Zbl 0651.05029
Summary: The linear arboricity of the graph G is the minimum number of linear forests whose union is G. In the paper exact values and bounds of linear arboricity for some additional classes of graphs are determined.
MSC:
| 05C05 | Trees |
References:
| [1] | A status on the linear arboricity. Lecture Notes in Comp. Science 108, Springer-Verlag Berlin Heidelberg New York (1981) 38–44. |
| [2] | Akiyama, Math. Slovaca 30 pp 405– (1980) |
| [3] | Akiyama, Networks 11 pp 69– (1981) |
| [4] | Enomoto, J. Graph Theory 8 pp 309– (1984) |
| [5] | Guldan, Math. Slovaca 36 (1986) |
| [6] | Harary, Ann. N.Y. Acad. Sci. 175 pp 198– (1970) · Zbl 0226.05119 · doi:10.1111/j.1749-6632.1970.tb56470.x |
| [7] | Graph Theory. Addison-Wesley, Reading, MA (1969). |
| [8] | Nash-Williams, J. London Math. Soc. 39 pp 12– (1964) |
| [9] | Peterson, Acta Math. 15 pp 193– (1891) |
| [10] | , and , Some results on path numbers. Proc. Louisiana Conf. Combinatorics, Graph Theory and Computing, Baton Rouge (1970) 112–135. |
| [11] | Tomasta, Math. Slovaca 32 pp 239– (1982) |
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
