AbstractDans cet article nous déterminons le nombre minimum d'arcs assurant l'existence d'un circuit de longueur k ou de longueur supérieure ou égale à k, dans un graphe orienté antisymétrique fortement connexe.In this article we determine the minimum number of arcs guaranteeing a cycle of length k or at least k in a strong oriented graph
AbstractWe prove the conjecture of D. A. Marcus (1981) that every strongly 2-arc-connected directed ...
AbstractAn exact bound is obtained for the number of edges in a directed graph which ensures the exi...
AbstractWe prove the theorem: Let G = (X, U) be an oriented strongly connected graph with n(≥2) vert...
AbstractDans cet article nous déterminons le nombre minimum d'arcs assurant l'existence d'un circuit...
AbstractIn this article we determine the maximum number of arcs of a strong diagraph of order n, wit...
AbstractIn this article, we give conditions on the total degrees of the vertices in a strong digraph...
AbstractIn this paper we present the upper and lower bounds of the longest directed cycle length for...
AbstractThe purpose of this communication is to announce some sufficient conditions on degrees and n...
We describe several conditions on the minimum number of arcs ensuring that any two vertices in a str...
AbstractA digraph of order at least k is termed k-traceable if each of its subdigraphs of order k is...
AbstractLet D be a strong digraph with n vertices and at least (n − 1)(n − 2) + 3 arcs. For any inte...
summary:An orientation of a simple graph is referred to as an oriented graph. Caccetta and Häggkvist...
AbstractAn n-tournament is an orientation of a complete n-partite graph. It was proved by J.A. Bondy...
AbstractWe show that for each ℓ⩾4 every sufficiently large oriented graph G with δ+(G),δ−(G)⩾⌊|G|/3⌋...
AbstractAnswering a question of Adrian Bondy (Per. Comm.), we prove that every strong digraph has a ...
AbstractWe prove the conjecture of D. A. Marcus (1981) that every strongly 2-arc-connected directed ...
AbstractAn exact bound is obtained for the number of edges in a directed graph which ensures the exi...
AbstractWe prove the theorem: Let G = (X, U) be an oriented strongly connected graph with n(≥2) vert...
AbstractDans cet article nous déterminons le nombre minimum d'arcs assurant l'existence d'un circuit...
AbstractIn this article we determine the maximum number of arcs of a strong diagraph of order n, wit...
AbstractIn this article, we give conditions on the total degrees of the vertices in a strong digraph...
AbstractIn this paper we present the upper and lower bounds of the longest directed cycle length for...
AbstractThe purpose of this communication is to announce some sufficient conditions on degrees and n...
We describe several conditions on the minimum number of arcs ensuring that any two vertices in a str...
AbstractA digraph of order at least k is termed k-traceable if each of its subdigraphs of order k is...
AbstractLet D be a strong digraph with n vertices and at least (n − 1)(n − 2) + 3 arcs. For any inte...
summary:An orientation of a simple graph is referred to as an oriented graph. Caccetta and Häggkvist...
AbstractAn n-tournament is an orientation of a complete n-partite graph. It was proved by J.A. Bondy...
AbstractWe show that for each ℓ⩾4 every sufficiently large oriented graph G with δ+(G),δ−(G)⩾⌊|G|/3⌋...
AbstractAnswering a question of Adrian Bondy (Per. Comm.), we prove that every strong digraph has a ...
AbstractWe prove the conjecture of D. A. Marcus (1981) that every strongly 2-arc-connected directed ...
AbstractAn exact bound is obtained for the number of edges in a directed graph which ensures the exi...
AbstractWe prove the theorem: Let G = (X, U) be an oriented strongly connected graph with n(≥2) vert...
DOI
Add to ORKG