Linear arboricity of digraphs

DOI10.1002/NET.3230170104MaRDI QIDQ3794200zbMATH OpenOpenAlexFDO

Authors

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

2-regular digraphsacyclic digraphsdigraphlinear diforestpaths

Mathematics Subject Classification ID

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

Recommendations

• Linear arboricity of regular digraphs
• Complexité de l'arboricité linéaire d'un graphe II
• Some results on linear arboricity
• Linear arboricity and linear k-arboricity of regular graphs
• scientific article; zbMATH DE number 2192133

Cites work

• COVERING AND PACKING IN GRAPHS, I.
• scientific article; zbMATH DE number 3989394 (Why is no real title available?)

Cited in

(18)

• The linear arboricity of graphs
• Probabilistic methods in coloring and decomposition problems
• n-dimensional line digraphs
• Bounded degree acyclic decompositions of digraphs.
• Linear \(k\)-arboricities on trees
• Linear arboricity of regular digraphs
• The linear arboricity of \(K_5\)-minor free graphs
• scientific article; zbMATH DE number 4134096 (Why is no real title available?)
• scientific article; zbMATH DE number 5846193 (Why is no real title available?)
• On directed pathos line cut vertex digraph of an arborescence
• Complexité de l'arboricité linéaire d'un graphe II
• Linear arboricity of random regular graphs
• The list linear arboricity of graphs
• Orientation‐based edge‐colorings and linear arboricity of multigraphs
• On an f-coloring generalization of linear arboricity of multigraphs
• Complexity results on the decomposition of a digraph into directed linear forests and out-stars
• Reachability in graphs having linear 2-arboricity two is \(\mathsf{NL}\)-hard
• Path decompositions of oriented graphs

This page was built for publication: Linear arboricity of digraphs

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