The linear 3-arboricity of \(K_{n,n}\) and \(K_n\)
type: Item
instance of: scholarly article
title: The linear 3-arboricity of \(K_{n,n}\) and \(K_n\)
zbMATH Open document ID: 1160.05015
author: Hung-Lin Fu
author: Kuo-Ching Huang
author: Chih-Hung Yen
published in: Discrete Mathematics
publication date: 2008-07-11T00:00:00Z
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 5300638
zbMATH Keywords: linear \(k\)-forest
zbMATH Keywords: linear \(k\)-arboricity
zbMATH Keywords: balanced complete bipartite graph
zbMATH Keywords: complete graph
MaRDI profile type: Publication
full work available at URL: j.disc.2007.07.067
OpenAlex ID: W2093043367
cites work: Q4222072
cites work: Linear arboricity and linear \(k\)-arboricity of regular graphs
cites work: On linear k-arboricity
cites work: Algorithmic aspects of linear \(k\)-arboricity
cites work: Linear \(k\)-arboricities on trees
cites work: Q4017192
cites work: On the linear \(k\)-arboricity of \(K_n\) and \(K_{n,n}\)
cites work: Q4326214
cites work: Some problems about linear arboricity
cites work: La k-Arboricité Linéaire Des Arbres
cites work: Parallel concepts in graph theory
cites work: On the linear \(k\)-arboricity of cubic graphs
cites work: The linear 2-arboricity of planar graphs
cites work: Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5
cites work: Linear 2-arboricity of the complete graph
DOI: 10.1016/J.DISC.2007.07.067
description: scientific article; zbMATH DE number 5300638