AbstractLet us call a linear-k-forest a graph whose connected components are chains of length at most k. The linear-k-arboricity of G (denoted lak (G)) is the minimum number of linear k-forests which partition E(G). We study this new index in two cases: cubic graphs and complete graphs (k = 2 or 3)
A linear k-forest of an undirected graph G is a subgraph of G whose components are paths with length...
A linear forest is a union of vertex-disjoint paths, and the linear arboricity of a graph $G$, denot...
The linear arboricity la(G) of a graph G is the minimum number of linear forests which partition the...
AbstractLet us call a linear-k-forest a graph whose connected components are chains of length at mos...
AbstractA linear k-forest of an undirected graph G is a subgraph of G whose components are paths wit...
AbstractWe present here a conjecture on partitioning the edges of a graph into k-linear forests (for...
AbstractBermond et al. [2] conjectured that the edge set of a cubic graph G can be partitioned into ...
AbstractA linear k-forest of a undirected graph G is a subgraph of G whose components are paths with...
A linear forest is a graph in which each connected component is a chordless path. A linear partition...
AbstractThe k-linear arboricity of a graph G is the minimum number of forests whose connected compon...
A linear forest is a graph that connected components are chordless paths. A linear partition of a gr...
AbstractA linear forest is a graph whose connected components are chordless paths. A linear partitio...
AbstractA linear k-forest is a forest whose components are paths of length at most k. The linear k-a...
The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the ...
The linear arboricity la(G) of a graph G is the minimum number of linear forests which partition the...
A linear k-forest of an undirected graph G is a subgraph of G whose components are paths with length...
A linear forest is a union of vertex-disjoint paths, and the linear arboricity of a graph $G$, denot...
The linear arboricity la(G) of a graph G is the minimum number of linear forests which partition the...
AbstractLet us call a linear-k-forest a graph whose connected components are chains of length at mos...
AbstractA linear k-forest of an undirected graph G is a subgraph of G whose components are paths wit...
AbstractWe present here a conjecture on partitioning the edges of a graph into k-linear forests (for...
AbstractBermond et al. [2] conjectured that the edge set of a cubic graph G can be partitioned into ...
AbstractA linear k-forest of a undirected graph G is a subgraph of G whose components are paths with...
A linear forest is a graph in which each connected component is a chordless path. A linear partition...
AbstractThe k-linear arboricity of a graph G is the minimum number of forests whose connected compon...
A linear forest is a graph that connected components are chordless paths. A linear partition of a gr...
AbstractA linear forest is a graph whose connected components are chordless paths. A linear partitio...
AbstractA linear k-forest is a forest whose components are paths of length at most k. The linear k-a...
The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the ...
The linear arboricity la(G) of a graph G is the minimum number of linear forests which partition the...
A linear k-forest of an undirected graph G is a subgraph of G whose components are paths with length...
A linear forest is a union of vertex-disjoint paths, and the linear arboricity of a graph $G$, denot...
The linear arboricity la(G) of a graph G is the minimum number of linear forests which partition the...
DOI
Add to ORKG