Shengjie He, Liancui Zuo, "The Linear K-Arboricity of the Mycielski Graph M(Kn)," WSEAS Transactions on Mathematics, vol. 14, pp. 1-9, 2015, DOI:
Shengjie He, Liancui Zuo. The Linear K-Arboricity of the Mycielski Graph M(Kn).
WSEAS Transactions on Mathematics. 2015;14:1-9.
WSEAS Transactions on Mathematics
Print ISSN: 1109-2769, E-ISSN: 2224-2880
Volume 14, 2015
The Linear K-Arboricity of the Mycielski Graph M(Kn)
Authors: ,
Abstract: 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 partition the edge set E(G) of G. In case that the lengths of paths are not restricted, we then have the linear arboricity of G, denoted by la(G). In this paper, the exact values of the linear 3-arboricity and the linear arboricity of the Mycielski graph M(Kn), and the linear k-arboricity of the Mycielski graph M(Kn) when n is even and k ≥ 5, are obtained.
Pages: 1-9 WSEAS Transactions on Mathematics, ISSN / E-ISSN: 1109-2769 / 2224-2880, Volume 14, 2015, Art. #1 DOI: *As the DOI is a unique identifier, it is already available in the pdf version.
**The DOI link will be activated in the first midst of January 2026.
×
Citation Tools