We survey results and open problems concerning the existence of (arc-)disjoint subdigraphs with certain properties in a digraph. Examples are arc-disjoint ...
Abstract. We survey results and open problems concerning the existence of (arc-)disjoint sub- digraphs with certain properties in a digraph.
An out-branching B+ in a digraph D = (V, A) is a connected spanning subdigraph of D in which each vertex x s has precisely one arc entering it and s has no arcs ...
We survey results and open problems concerning the existence of (arc-)disjoint subdigraphs with certain properties in a digraph. Examples are arc-disjoint ...
We prove that a number of natural problems concerning the existence of arc-disjoint directed and “undirected” (spanning) subdigraphs in a digraph are ...
Dec 20, 2018 · Abstract:A digraph D=(V,A) has a good decomposition if A has two disjoint sets A_1 and A_2 such that both (V,A_1) and (V,A_2) are strong.
People also search for
We survey results and open problems concerning the existence of (arc-)disjoint subdigraphs with certain properties in a digraph. Examples are arc-disjoint ...
People also ask
What is a disjoint graph?
What is a digraph in graphs?
A digraph $D=(V,A)$ has a good decomposition if $A$ has two disjoint sets $A_1$ and $A_2$ such that both $(V,A_1)$ and $(V,A_2)$ are strong.
Oct 25, 2021 · Abstract. In this paper, we study two types of strong subgraph packing prob- lems in digraphs, including internally disjoint strong subgraph ...
Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs · Yuefang Sun, G. Gutin, J. Ai · Published in Discrete Mathematics 20 December ...