Abstract
In a inear forest, each component is a path. The linear arboricity ≡(G) of a graph G is defined in Harary [8] as the minimum number of linear forests whose union is G. This invariant first arose in a study [10] of information retrieval in file systems. A quite similar covering invariant which is well known to the linear arboricity is the arboricity of a graph, which is defined as the minimum number of forests whose union is G. Nash-Williams [11] determined the arboricity of any graph, however only few results on the linear arboricity are known. We shall present these discoveries and an open problem on this new invariant.
Chapter PDF
Similar content being viewed by others
References
J.Akiyama and V.Chvátal, Another proof of the linear arboricity for cubic graphs, to appear.
J.Akiyama, G.Exoo and F.Harary, Covering and packing in graphs III: Cyclic and acyclic invariants. Math. Slovaca 29(1980)
J.Akiyama, G.Exoo and F.Harary, Covering and packing in graphs IV: Linear arboricity. Networks 11(1981)
J. Akiyama and T. Hamada, The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests. Discrete Math. 26(1979)203–208.
J.Akiyama and I.Sato, A comment on the linear arboricity for regular multigraphs, to appear.
M. Behzad, G. Chartrand and L. Lesniak-Foster, Graphs and Digraphs, Prindle, Weber & Schmidt, Boston (1979)
H.Enomoto, The linear arboricity of cubic graphs and 4-regular graphs, Private communication.
F. Harary, Covering and packing I, Ann. N.Y.Acad. Sci. 175(1970)198–205.
F.Harary, Graph Theory, Addison-Wesley, Mass. (1969)
F. Harary and D. Hsiao, A formal system for information retrieval files, Comm.A.C.M., 13(1970)67–73.
C. Nash-Williams, Decomposition of finite graphs into forests. J. London Math Soc. 39(1964)12.
B.Peroche, On partition of graphs into linear forests and dissections, Rapport de recherche, Centre National de la recherche scientifique
J. Petersen, Die Theorie der regularen Graphen, Acta Math. 15(1891)193–200.
R. Stanton, D. Cowan and L. James, Some results on path numbers, Proc. Louisiana Conf. Combinatorics, Graph Theory and Computing, Baton, Rouge (1970)112–135.
W. Tutte, The subgraph problem, Advances in Graph Theory (B. Bollbás, ed.) North-Holland, Amsterdam (1978)289–295.
V. Vizing, On an estimate of the chromatic class of p-graph, Diskret. Analiz. 3(1964)25–30.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Akiyama, J. (1981). A status on the linear arboricity. In: Saito, N., Nishizeki, T. (eds) Graph Theory and Algorithms. Lecture Notes in Computer Science, vol 108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10704-5_4
Download citation
DOI: https://doi.org/10.1007/3-540-10704-5_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10704-0
Online ISBN: 978-3-540-38661-2
eBook Packages: Springer Book Archive