Add to ORKGWe describe several conditions on the minimum number of arcs ensuring that any two vertices in a strong oriented graph are joining by a path of length at most a given $k$, or ensuring that they are contained in a common cycle
Abstract. Let G be a graph of radius r and diameter d with d ≤ 2r − 2. We show that G contains a cyc...
AbstractIn this article we determine the maximum number of arcs of a strong diagraph of order n, wit...
AbstractIn this paper, we consider the length of the longest cycle through specified vertices. We sh...
We describe several conditions on the minimum number of arcs ensuring that any two vertices in a str...
AbstractDans cet article nous déterminons le nombre minimum d'arcs assurant l'existence d'un circuit...
AbstractIn this paper, by using minimum out-degree and minimum in-degree, we give a new lower bound ...
International audienceAn oriented graph $\overrightarrow{G}$ is said weak (resp. strong) if, for eve...
AbstractThe purpose of this communication is to announce some sufficient conditions on degrees and n...
AbstractIn this article, we give conditions on the total degrees of the vertices in a strong digraph...
A strong orientation of a graph $G$ is an assignment of a direction to each edge such that $G$ is st...
AbstractIn this paper we present the upper and lower bounds of the longest directed cycle length for...
AbstractWe prove the theorem: Let G = (X, U) be an oriented strongly connected graph with n(≥2) vert...
AbstractIn 1978, Chvátal and Thomassen proved that every 2-edge-connected graph with diameter 2 has ...
AbstractWe prove the conjecture of D. A. Marcus (1981) that every strongly 2-arc-connected directed ...
AbstractWe show that for each ℓ⩾4 every sufficiently large oriented graph G with δ+(G),δ−(G)⩾⌊|G|/3⌋...
Abstract. Let G be a graph of radius r and diameter d with d ≤ 2r − 2. We show that G contains a cyc...
AbstractIn this article we determine the maximum number of arcs of a strong diagraph of order n, wit...
AbstractIn this paper, we consider the length of the longest cycle through specified vertices. We sh...
We describe several conditions on the minimum number of arcs ensuring that any two vertices in a str...
AbstractDans cet article nous déterminons le nombre minimum d'arcs assurant l'existence d'un circuit...
AbstractIn this paper, by using minimum out-degree and minimum in-degree, we give a new lower bound ...
International audienceAn oriented graph $\overrightarrow{G}$ is said weak (resp. strong) if, for eve...
AbstractThe purpose of this communication is to announce some sufficient conditions on degrees and n...
AbstractIn this article, we give conditions on the total degrees of the vertices in a strong digraph...
A strong orientation of a graph $G$ is an assignment of a direction to each edge such that $G$ is st...
AbstractIn this paper we present the upper and lower bounds of the longest directed cycle length for...
AbstractWe prove the theorem: Let G = (X, U) be an oriented strongly connected graph with n(≥2) vert...
AbstractIn 1978, Chvátal and Thomassen proved that every 2-edge-connected graph with diameter 2 has ...
AbstractWe prove the conjecture of D. A. Marcus (1981) that every strongly 2-arc-connected directed ...
AbstractWe show that for each ℓ⩾4 every sufficiently large oriented graph G with δ+(G),δ−(G)⩾⌊|G|/3⌋...
Abstract. Let G be a graph of radius r and diameter d with d ≤ 2r − 2. We show that G contains a cyc...
AbstractIn this article we determine the maximum number of arcs of a strong diagraph of order n, wit...
AbstractIn this paper, we consider the length of the longest cycle through specified vertices. We sh...