Add to ORKGMy dissertation research was motivated by Matula and his study of a quantity he called the strength of a graph G, kappa\u27( G) = max{lcub}kappa\u27(H) : H G{rcub}. (Abstract shortened by ProQuest.)
AbstractFor a strongly connected digraph D the restricted arc-connectivity λ′(D) is defined as the m...
International audienceIn this paper, we present new incremental algorithms for maintaining data stru...
AbstractAnswering a question of Adrian Bondy (Per. Comm.), we prove that every strong digraph has a ...
For a strongly connected digraph D the restricted arc-connectivity λ′(D) is defined as the minimum c...
AbstractThis paper deals with increasing the arc-connectivity of directed graphs by arc additions, r...
AbstractThe strong independence number βs(D) of a digraph D is the maximum cardinality of a set S of...
For a strongly connected digraph D the restricted arc-connectivity λ'(D) is defined as the minimum c...
AbstractThe strong independence number βs(D) of a digraph D is the maximum cardinality of a set S of...
For a given digraph $D$ and distinct $u,v \in V(D)$, we denote by $\lambda_D(u,v)$ the local arc-con...
AbstractThis paper deals with increasing the arc-connectivity of directed graphs by arc additions, r...
Let D = (V (D),A(D)) be a strongly connected digraph. An arc set S ⊆ A(D) is a restricted arc-cut of...
We consider finite and simple digraphs. Usually, we use G to denote a graph and D to a digraph. Unde...
This paper deals with increasing the arc-connectivity of directed graphs by arc additions, reversals...
AbstractThis paper studies the relation between the connectivity and other parameters of a bipartite...
AbstractIn this paper, by using minimum out-degree and minimum in-degree, we give a new lower bound ...
AbstractFor a strongly connected digraph D the restricted arc-connectivity λ′(D) is defined as the m...
International audienceIn this paper, we present new incremental algorithms for maintaining data stru...
AbstractAnswering a question of Adrian Bondy (Per. Comm.), we prove that every strong digraph has a ...
For a strongly connected digraph D the restricted arc-connectivity λ′(D) is defined as the minimum c...
AbstractThis paper deals with increasing the arc-connectivity of directed graphs by arc additions, r...
AbstractThe strong independence number βs(D) of a digraph D is the maximum cardinality of a set S of...
For a strongly connected digraph D the restricted arc-connectivity λ'(D) is defined as the minimum c...
AbstractThe strong independence number βs(D) of a digraph D is the maximum cardinality of a set S of...
For a given digraph $D$ and distinct $u,v \in V(D)$, we denote by $\lambda_D(u,v)$ the local arc-con...
AbstractThis paper deals with increasing the arc-connectivity of directed graphs by arc additions, r...
Let D = (V (D),A(D)) be a strongly connected digraph. An arc set S ⊆ A(D) is a restricted arc-cut of...
We consider finite and simple digraphs. Usually, we use G to denote a graph and D to a digraph. Unde...
This paper deals with increasing the arc-connectivity of directed graphs by arc additions, reversals...
AbstractThis paper studies the relation between the connectivity and other parameters of a bipartite...
AbstractIn this paper, by using minimum out-degree and minimum in-degree, we give a new lower bound ...
AbstractFor a strongly connected digraph D the restricted arc-connectivity λ′(D) is defined as the m...
International audienceIn this paper, we present new incremental algorithms for maintaining data stru...
AbstractAnswering a question of Adrian Bondy (Per. Comm.), we prove that every strong digraph has a ...