Linear arboricity

In graph theory, a branch of mathematics, the linear arboricity of an undirected graph is the smallest number of linear forests its edges can be…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

The linear arboricity $la(G)$ of a graph $G$ is the minimum number of linear forests which partition the edges of $G$. In this…

2013

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…

2013

This paper discusses three types of proximity graphs called LOGs, GIGs and GIRLs, defined on unit grids. We show that it can be…

2011

2007

The invention is directed to a container for tablets, pills or the like having means to permit easy dispensing of tablets, pills…

2005

It is proved here that a connected graph G has the linear arboricity la(G)=「Δ/2 if |E||V|+「3Δ/2-4.

1998

Bermond et al. [5] conjectured that the edge set of a cubic graph G can be partitioned into two linear k-forests, that is to say…

1991

In a linear forest, every component is a path. The linear arboricity of a graph G is the smallest number of edge disjoint linear…

1987

Akiyama, Exoo, and Harary conjectured that for any simple graph G with maximum degree Δ(G), the linear arboricity la(G) satisfies…

1980

In a inear forest, each component is a path. The linear arboricity ≡(G) of a graph G is defined in Harary [8] as the minimum…