Some results on linear arboricity
Author:
- 1 December 1986
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 10 (4) , 505-509
Abstract
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.Keywords
This publication has 6 references indexed in Scilit:
- The linear arboricity of some regular graphsJournal of Graph Theory, 1984
- Covering and packing in graphs IV: Linear arboricityNetworks, 1981
- COVERING AND PACKING IN GRAPHS, I.Annals of the New York Academy of Sciences, 1970
- GRAPH THEORY1969
- Decomposition of Finite Graphs Into ForestsJournal of the London Mathematical Society, 1964
- Die Theorie der regulären graphsActa Mathematica, 1891