1981/03/01 by Jin Akiyama, Geoffrey Exoo, Frank Harary · 5 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Interconnection Networks and Systems #Graph theory and applications
paper · doi:10.1002/net.3230110108
openalex publication_date 1981/03/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/06/26
Abstract The linear arboricity of a graph is the minimum number of linear forests into which its lines can be decomposed. We find that the linear arboricity of every 4‐regular graph is 3. This result enables us to obtain bounds for the linear arboricity of any graph in terms of its maximum degree.