Some results on linear arboricity
From MaRDI portal
Publication:3795688
DOI10.1002/jgt.3190100408zbMath0651.05029OpenAlexW2018626253MaRDI QIDQ3795688
Publication date: 1986
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190100408
Related Items
Graph factors and factorization: 1985--2003: a survey, The linear arboricity of graphs, Edge coloring of signed graphs, The list linear arboricity of graphs, Orientation‐based edge‐colorings and linear arboricity of multigraphs, Three ways to cover a graph, Almost Every Graph can be Covered by Linear Forests, Edge-intersection graphs of grid paths: the bend-number, On the bend-number of planar and outerplanar graphs, Decompositions of graphs into forests with bounded maximum degree, Unnamed Item, Unnamed Item, Linear \(k\)-arboricities on trees, Note on linear arboricity of graphs with large girth, Factorisation of regular graphs into forests of short paths, Upper bound for linear arboricity
Cites Work
