The Linear 2- and 4-Arboricity of Complete Bipartite Graph Km,n
Joint Authors
Zuo, Liancui
He, Shengjie
Xue, Bing
Source
International Journal of Combinatorics
Issue
Vol. 2013, Issue 2013 (31 Dec. 2013), pp.1-6, 6 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2013-12-30
Country of Publication
Egypt
No. of Pages
6
Main Subjects
Abstract EN
A linear k-forest of an undirected graph G is a subgraph of G whose components are paths with lengths at most k.
The linear k-arboricity of G, denoted by lak(G), is the minimum number of linear k-forests needed to decompose G.
In case the lengths of paths are not restricted, we then have the linear arboricity of G, denoted by la(G).
In this paper, the exact value of the linear 2- and 4-arboricity of complete bipartite graph Km,n for some m and n is obtained.
American Psychological Association (APA)
Zuo, Liancui& Xue, Bing& He, Shengjie. 2013. The Linear 2- and 4-Arboricity of Complete Bipartite Graph Km,n. International Journal of Combinatorics،Vol. 2013, no. 2013, pp.1-6.
https://search.emarefa.net/detail/BIM-476605
Modern Language Association (MLA)
Zuo, Liancui…[et al.]. The Linear 2- and 4-Arboricity of Complete Bipartite Graph Km,n. International Journal of Combinatorics No. 2013 (2013), pp.1-6.
https://search.emarefa.net/detail/BIM-476605
American Medical Association (AMA)
Zuo, Liancui& Xue, Bing& He, Shengjie. The Linear 2- and 4-Arboricity of Complete Bipartite Graph Km,n. International Journal of Combinatorics. 2013. Vol. 2013, no. 2013, pp.1-6.
https://search.emarefa.net/detail/BIM-476605
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-476605
