#### Filter Results:

#### Publication Year

2013

2015

#### Publication Type

#### Co-author

#### Publication Venue

Learn More

- Liancui Zuo, Shengjie He, Bing Xue
- 2015

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 la k (G), is the minimum number of linear k-forests needed to partition the edge set E(G) of G. In this paper, the exact values of the linear (n − 1)-arboricity of Hamming graph, and Cartesian product… (More)

- SHENGJIE HE, Liancui Zuo
- 2015

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 la k (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… (More)

- ‹
- 1
- ›