On the linearK-arboricity of cubic graphs

DOI10.1080/00207160008804996zbMath0967.68125OpenAlexW2043093172MaRDI QIDQ4521950

Janez Žerovnik, Aleksander Vesel

Publication date: 21 December 2000

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160008804996

zbMATH Keywords

cubic graphlinear arboricitycomputer search

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

On the linear \((n - 1)\)-arboricity of \(K_{n(m)}\) ⋮ The linear 2- and 4-arboricity of complete bipartite graph \(K_{m,n}\)

Cites Work

• Unnamed Item
• On linear k-arboricity
• Some problems about linear arboricity
• On the linear \(k\)-arboricity of cubic graphs
• The linear arboricity of some regular graphs
• Almost Every Graph can be Covered by Linear Forests

This page was built for publication: On the linearK-arboricity of cubic graphs