𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The linear arboricity of some regular graphs

✍ Scribed by Hikoe Enomoto; Bernard Péroche

Publisher
John Wiley and Sons
Year
1984
Tongue
English
Weight
582 KB
Volume
8
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

W e prove that the linear arboricity of every 5-regular graph is 3. That is, the edges of any 5-regular graph are covered by three linear forests. W e also determine the linear arboricity of 6-regular graphs and 8-regular graphs. These results improve the known upper bounds for the linear arboricity of graphs with given maximum degree.

📜 SIMILAR VOLUMES

The star-arboricity of the complete regu
The star-arboricity of the complete regular multipartite graphs
✍ Yasukazu Aoki 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 331 KB

A subgraph H of a graph G is called a star-subgraph if each component of H is a star. The star-arboricify of G, denoted by sa(G), is the minimum number of star-subgraphs that partition the edges of G. In this paper we show that sa(G) is [r/21 + 1 or [r/2] + 2 for the complete r-regular multipartite

On the linear arboricity of planar graph
On the linear arboricity of planar graphs
✍ Wu, Jian-Liang 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 188 KB 👁 2 views

The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. Akiyama, Exoo, and Harary conjectured for any simple graph G with maximum degree ∆. The conjecture has been proved to be true for graphs having ∆ =

On the linear k-arboricity of cubic grap
On the linear k-arboricity of cubic graphs
✍ Bill Jackson; Nicholas C. Wormald 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 231 KB

Bermond et al. [2] conjectured that the edge set of a cubic graph G can be partitioned into two k-linear forests, that is to say two forests whose connected components are paths of length at most k, for all k >/5. We shall prove a weaker result that the statement is valid for all k/> 18. All graphs

On linear vertex-arboricity of complemen
On linear vertex-arboricity of complementary graphs
✍ Yousef Alavi; Jiuqiang Liu; Jianfang Wang 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 323 KB 👁 1 views

## Abstract The linear vertex‐arboricity ρ(__G__) of a graph __G__ is defined to be the minimum number of subsets into which the vertex set of __G__ can be partitioned such that each subset induces a linear forest. In this paper, we give the sharp upper and lower bounds for the sum and product of l

On point-linear arboricity of planar gra
On point-linear arboricity of planar graphs
✍ Jianfang Wang 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 220 KB

The point-linear arboricity of a graph G = (V, E), written as p,(G), is defined as p,(G) =min{k / there exists a partition of V into k subsets, V =LJt, V,, such that (V,) is a linear forest for 1 <i <k}. In this paper, we will discuss the point-linear arboricity of planar graphs and obtained follow