research
∙
11/08/2022
Directed Steiner path packing and directed path connectivity
For a digraph D=(V(D), A(D)), and a set S⊆ V(D) with r∈ S and |S|≥ 2, a ...
share
research
∙
08/18/2022
Perfect Out-forests and Steiner Cycle Packing in Digraphs
In this paper, we study the complexity of two types of digraph packing p...
research
∙
01/22/2022
Strong subgraph 2-arc-connectivity and arc-strong connectivity of Cartesian product of digraphs
Let D=(V,A) be a digraph of order n, S a subset of V of size k and 2≤ k≤...
research
∙
06/19/2019
Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs
A digraph D=(V, A) has a good pair at a vertex r if D has a pair of arc-...
research
∙
01/18/2019
Extremality and Sharp Bounds for the k-edge-connectivity of Graphs
Boesch and Chen (SIAM J. Appl. Math., 1978) introduced the cut-version o...
research
∙
12/20/2018
Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs
A digraph D=(V,A) has a good decomposition if A has two disjoint sets A_...
research
∙
08/08/2018
Strong Subgraph Connectivity of Digraphs: A Survey
In this survey we overview known results on the strong subgraph k-connec...
research
∙
05/04/2018
Strong subgraph k-arc-connectivity
Two previous papers, arXiv:1803.00284 and arXiv:1803.00281, introduced a...
research
∙
03/01/2018
Strong Subgraph k-connectivity
Generalized connectivity introduced by Hager (1985) has been studied ext...
research
∙
03/01/2018
