On the linearK-arboricity of cubic graphs

DOI10.1080/00207160008804996MaRDI QIDQ4521950zbMATH OpenOpenAlexFDO

Authors Aleksander Vesel, Janez Žerovnik

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

computer searchcubic graphlinear arboricity

Mathematics Subject Classification ID

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

Recommendations

• On the linear k-arboricity of cubic graphs
• scientific article; zbMATH DE number 5846193
• scientific article; zbMATH DE number 1229605
• Partitioning circulant graphs into isomorphic linear forests
• On linear k-arboricity

Cites work

• Almost Every Graph can be Covered by Linear Forests
• scientific article; zbMATH DE number 3261581 (Why is no real title available?)
• On linear k-arboricity
• On the linear k-arboricity of cubic graphs
• Some problems about linear arboricity
• The linear arboricity of some regular graphs

Cited in

(9)

• On the linear k-arboricity of cubic graphs
• The linear 2- and 4-arboricity of complete bipartite graph \(K_{m,n}\)
• scientific article; zbMATH DE number 5846193 (Why is no real title available?)
• scientific article; zbMATH DE number 3873386 (Why is no real title available?)
• On odd and semi-odd linear partitions of cubic graphs
• scientific article; zbMATH DE number 1229605 (Why is no real title available?)
• On isomorphic linear partitions in cubic graphs
• On isomorphic linear partitions in cubic graphs
• On the linear \((n - 1)\)-arboricity of \(K_{n(m)}\)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4521950)