Bounded degree acyclic decompositions of digraphs.

DOI10.1016/j.jctb.2003.08.004zbMath1033.05087OpenAlexW2002893084MaRDI QIDQ1426101

David R. Wood

Publication date: 14 March 2004

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2003.08.004

zbMATH Keywords

DigraphArboricityAcyclic decompositionAcyclic subgraphDiarboricity

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items

Majority colourings of digraphs, Majority edge-colorings of graphs, Linear arboricity of regular digraphs, Acyclic Digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Area-efficient static and incremental graph drawings
• Balanced vertex-orderings of graphs
• Optimal three-dimensional orthogonal graph drawing in the general position model.
• Linear arboricity of digraphs