AbstractA linear k-forest is a forest whose components are paths of length at most k. The linear k-arboricity of a graph G, denoted by lak(G), is the least number of linear k-forests needed to decompose G. In this paper, we completely determine lak(G) when G is a balanced complete bipartite graph Kn,n or a complete graph Kn, and k=3
A linear forest is a graph in which each connected component is a chordless path. A linear partition...
A linear k-forest of an undirected graph G is a subgraph of G whose components are paths with length...
AbstractFor a fixed positive integer k, the linear k-arboricity lak(G) of a graph G is the minimum n...
AbstractA linear k-forest of an undirected graph G is a subgraph of G whose components are paths wit...
AbstractA linear k-forest is a forest whose components are paths of length at most k. The linear k-a...
AbstractLet us call a linear-k-forest a graph whose connected components are chains of length at mos...
AbstractA linear k-forest of a undirected graph G is a subgraph of G whose components are paths with...
AbstractThe linear arboricity of a graph G is the minimum number of linear forests which partition t...
AbstractWe present here a conjecture on partitioning the edges of a graph into k-linear forests (for...
AbstractThe fractional arboricity γf(G) of a graph G is the maximum of the ratio |E(G[X])|/(|X|−1) o...
AbstractA linear forest is a graph whose connected components are chordless paths. A linear partitio...
The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the ...
A linear forest is a union of vertex-disjoint paths, and the linear arboricity of a graph $G$, denot...
AbstractBermond et al. [2] conjectured that the edge set of a cubic graph G can be partitioned into ...
Formulas are obtained for the number of m-cycles, γm(G, n), and the number of all cycles, γ(G, n), i...
A linear forest is a graph in which each connected component is a chordless path. A linear partition...
A linear k-forest of an undirected graph G is a subgraph of G whose components are paths with length...
AbstractFor a fixed positive integer k, the linear k-arboricity lak(G) of a graph G is the minimum n...
AbstractA linear k-forest of an undirected graph G is a subgraph of G whose components are paths wit...
AbstractA linear k-forest is a forest whose components are paths of length at most k. The linear k-a...
AbstractLet us call a linear-k-forest a graph whose connected components are chains of length at mos...
AbstractA linear k-forest of a undirected graph G is a subgraph of G whose components are paths with...
AbstractThe linear arboricity of a graph G is the minimum number of linear forests which partition t...
AbstractWe present here a conjecture on partitioning the edges of a graph into k-linear forests (for...
AbstractThe fractional arboricity γf(G) of a graph G is the maximum of the ratio |E(G[X])|/(|X|−1) o...
AbstractA linear forest is a graph whose connected components are chordless paths. A linear partitio...
The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the ...
A linear forest is a union of vertex-disjoint paths, and the linear arboricity of a graph $G$, denot...
AbstractBermond et al. [2] conjectured that the edge set of a cubic graph G can be partitioned into ...
Formulas are obtained for the number of m-cycles, γm(G, n), and the number of all cycles, γ(G, n), i...
A linear forest is a graph in which each connected component is a chordless path. A linear partition...
A linear k-forest of an undirected graph G is a subgraph of G whose components are paths with length...
AbstractFor a fixed positive integer k, the linear k-arboricity lak(G) of a graph G is the minimum n...
DOI
Add to ORKG