Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

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

2013

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… Expand

Is this relevant?

2012

2012

The linear arboricity la(G) of a graph G is the minimum number of linear forests (graphs where every connected component is a… Expand

Is this relevant?

2007

2007

The linear arboricity of a graph G is the minimum number of linear forests which partition the edges of G. Akiyama, Exoo and… Expand

Is this relevant?

2006

2006

A distance graph is a graph G(R,D) with the set of all points of the real line as vertex set and two vertices u,[email protected… Expand

Is this relevant?

2001

2001

Abstract. We find upper bounds on the linear k-arboricity of d-regular graphs using a probabilistic argument. For small k these… Expand

Is this relevant?

1988

1988

The point-linear arboricity of a graph G=(V, E), written as p 0 (G), is defined as p 0 (G)=min{k | there exists a partition of V… Expand

Is this relevant?

Highly Cited

1988

Highly Cited

1988

AbstractAlinear forest is a forest in which each connected component is a path. Thelinear arboricity la(G) of a graphG is the… Expand

Is this relevant?

1987

1987

A linear diforest is a digraph whose connected components are paths. We define the linear arboricity of a digraph, denoted la(G… Expand

Is this relevant?

1982

1982

We present here a conjecture on partitioning the edges of a graph into k-linear forests (forest whose connected components are… Expand

Is this relevant?

1981

1981

The linear arboricity of a graph is the minimum number of linear forests into which its lines can be decomposed. We find that the… Expand

Is this relevant?