AbstractThis paper deals with increasing the arc-connectivity of directed graphs by arc additions, reversals or complements. We study several optimization problems, which differ in their arc-connectivity requirements defined by the set of sources, the set of targets and the arc-connectivity value
For k¿=¿2, a strongly connected digraph D is called -connected if it contains a set of arcs W such t...
AbstractWe present a generalization of the Steiner problem in a directed graph. Given nonnegative we...
AbstractA digraph is said to be super-connected if every minimum vertex cut is the out-neighbor set ...
AbstractThis paper deals with increasing the arc-connectivity of directed graphs by arc additions, r...
This paper deals with increasing the arc-connectivity of directed graphs by arc additions, reversals...
For a given digraph $D$ and distinct $u,v \in V(D)$, we denote by $\lambda_D(u,v)$ the local arc-con...
My dissertation research was motivated by Matula and his study of a quantity he called the strength ...
For a strongly connected digraph D the restricted arc-connectivity λ′(D) is defined as the minimum c...
For a strongly connected digraph D the restricted arc-connectivity λ'(D) is defined as the minimum c...
AbstractIn this paper we collect a substantial number of challenging open problems and conjectures o...
Let D = (V (D),A(D)) be a strongly connected digraph. An arc set S ⊆ A(D) is a restricted arc-cut of...
AbstractFor a strongly connected digraph D the restricted arc-connectivity λ′(D) is defined as the m...
AbstractIn this paper we deal with the arc ranking problem of directed graphs. We give some classes ...
Special issue: Graph DecompositionsInternational audienceA complementation operation on a vertex of ...
AbstractG. A. Dirac gives a necessary arc family condition for a graph to be n-vertex connected. The...
For k¿=¿2, a strongly connected digraph D is called -connected if it contains a set of arcs W such t...
AbstractWe present a generalization of the Steiner problem in a directed graph. Given nonnegative we...
AbstractA digraph is said to be super-connected if every minimum vertex cut is the out-neighbor set ...
AbstractThis paper deals with increasing the arc-connectivity of directed graphs by arc additions, r...
This paper deals with increasing the arc-connectivity of directed graphs by arc additions, reversals...
For a given digraph $D$ and distinct $u,v \in V(D)$, we denote by $\lambda_D(u,v)$ the local arc-con...
My dissertation research was motivated by Matula and his study of a quantity he called the strength ...
For a strongly connected digraph D the restricted arc-connectivity λ′(D) is defined as the minimum c...
For a strongly connected digraph D the restricted arc-connectivity λ'(D) is defined as the minimum c...
AbstractIn this paper we collect a substantial number of challenging open problems and conjectures o...
Let D = (V (D),A(D)) be a strongly connected digraph. An arc set S ⊆ A(D) is a restricted arc-cut of...
AbstractFor a strongly connected digraph D the restricted arc-connectivity λ′(D) is defined as the m...
AbstractIn this paper we deal with the arc ranking problem of directed graphs. We give some classes ...
Special issue: Graph DecompositionsInternational audienceA complementation operation on a vertex of ...
AbstractG. A. Dirac gives a necessary arc family condition for a graph to be n-vertex connected. The...
For k¿=¿2, a strongly connected digraph D is called -connected if it contains a set of arcs W such t...
AbstractWe present a generalization of the Steiner problem in a directed graph. Given nonnegative we...
AbstractA digraph is said to be super-connected if every minimum vertex cut is the out-neighbor set ...