AbstractIn this paper we present the upper and lower bounds of the longest directed cycle length for minimal strong digraphs in terms of the numbers of vertices and arcs. These bounds are both sharp. In addition, we give analogous results for minimal 2-edge connected graphs
AbstractAnswering a question of Adrian Bondy (Per. Comm.), we prove that every strong digraph has a ...
AbstractIt is shown that there exists a positiveεso that for any integerk, every directed graph with...
AbstractIn “On signed digraphs with all cycles negative”, Discrete Appl. Math. 12 (1985) 155–164, F....
AbstractIn this paper we present the upper and lower bounds of the longest directed cycle length for...
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...
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...
AbstractIn this paper we determine the maximum number of edges that a strong digraph can have if it ...
AbstractIt is proved that every directed graph with n vertices and minimum outdegree k contains a di...
AbstractAn exact bound is obtained for the number of edges in a directed graph which ensures the exi...
A digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mu...
AbstractWe prove the conjecture of D. A. Marcus (1981) that every strongly 2-arc-connected directed ...
AbstractCaccetta and Häggkvist [1] conjectured that every digraph with n vertices and minimum outdeg...
AbstractWe show that every digraph D with minimum outdegree δ and maximum indegree Δ contains a dire...
AbstractAnswering a question of Adrian Bondy (Per. Comm.), we prove that every strong digraph has a ...
AbstractIt is shown that there exists a positiveεso that for any integerk, every directed graph with...
AbstractIn “On signed digraphs with all cycles negative”, Discrete Appl. Math. 12 (1985) 155–164, F....
AbstractIn this paper we present the upper and lower bounds of the longest directed cycle length for...
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...
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...
AbstractIn this paper we determine the maximum number of edges that a strong digraph can have if it ...
AbstractIt is proved that every directed graph with n vertices and minimum outdegree k contains a di...
AbstractAn exact bound is obtained for the number of edges in a directed graph which ensures the exi...
A digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mu...
AbstractWe prove the conjecture of D. A. Marcus (1981) that every strongly 2-arc-connected directed ...
AbstractCaccetta and Häggkvist [1] conjectured that every digraph with n vertices and minimum outdeg...
AbstractWe show that every digraph D with minimum outdegree δ and maximum indegree Δ contains a dire...
AbstractAnswering a question of Adrian Bondy (Per. Comm.), we prove that every strong digraph has a ...
AbstractIt is shown that there exists a positiveεso that for any integerk, every directed graph with...
AbstractIn “On signed digraphs with all cycles negative”, Discrete Appl. Math. 12 (1985) 155–164, F....
DOI
Add to ORKG