Linear arboricity of digraphs

DOI10.1002/net.3230170104zbMath0649.05029OpenAlexW2056835655MaRDI QIDQ3794200

No author found.

Publication date: 1987

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230170104

zbMATH Keywords

pathsdigraphacyclic digraphs2-regular digraphslinear diforest

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items

The linear arboricity of graphs, Orientation‐based edge‐colorings and linear arboricity of multigraphs, On an \(f\)-coloring generalization of linear arboricity of multigraphs, Bounded degree acyclic decompositions of digraphs., Linear arboricity of regular digraphs, Linear \(k\)-arboricities on trees, The linear arboricity of \(K_5\)-minor free graphs, Probabilistic methods in coloring and decomposition problems

Cites Work

• COVERING AND PACKING IN GRAPHS, I.
• Unnamed Item