Complexity results on the decomposition of a digraph into directed linear forests and out-stars

DOI10.37236/12717MaRDI QIDQ6635181

Florian Hoersch, L. Picasarri-Arrieta

Publication date: 9 November 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

\(\ell \)-bounded out-galaxy\(k\)-bounded digraphs

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On spanning galaxies in digraphs
• Isogeometric analysis of free-surface flow
• The star arboricity of graphs
• Linear arboricity of regular digraphs
• Complexity of some arc-partition problems for digraphs
• Bounds on directed star arboricity in some digraph classes
• WDM and Directed Star Arboricity
• Linear arboricity of digraphs
• Digraphs
• Decomposition of Finite Graphs Into Forests
• Combinatorial optimization. Theory and algorithms.
• Decompositions into two linear forests of bounded lengths

This page was built for publication: Complexity results on the decomposition of a digraph into directed linear forests and out-stars

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