AbstractWe prove the conjecture of D. A. Marcus (1981) that every strongly 2-arc-connected directed graph has a directed cycle with at least two chords. As a consequence, every strongly 2-arc-connected directed graph withmarcs has a spanning strong directed subgraph with less than 23 arcs. The constant 23 is best possible
AbstractThe purpose of this communication is to announce some sufficient conditions on degrees and n...
AbstractLet Cl(n;d be the class of all directed graphsG, without loops and without multiple arcs, su...
AbstractIn this article we determine the maximum number of arcs of a strong diagraph of order n, wit...
AbstractAnswering a question of Adrian Bondy (Per. Comm.), we prove that every strong digraph has a ...
We consider the problem (MSSS) of finding the minimum number of arcs in a spanning strongly connecte...
AbstractIn this paper we present the upper and lower bounds of the longest directed cycle length for...
International audienceIn 1963, Tibor Gallai~\cite{TG} asked whether every strongly connected directe...
In 1963, Tibor Gallai [9] asked whether every strongly connected directed graph D is spanned by α di...
AbstractA digraph D is strong if it contains a directed path from x to y for every choice of vertice...
Given a k-arc-strong tournament T, we estimate the minimum number of arcs possible in a k-arc-strong...
AbstractThe classes of multidigraphs for which Ádám's conjecture (that any digraph containing a dire...
The so-called Kelly conjecture1 states that every regular tournament on 2k+1 vertices has a decompos...
AbstractJamison proved that every cycle of length greater than three in a graph has a chord—in other...
AbstractDans cet article nous déterminons le nombre minimum d'arcs assurant l'existence d'un circuit...
AbstractWe establish a directed analogue of Whtney's 2-switching theorem for graphs and apply it to ...
AbstractThe purpose of this communication is to announce some sufficient conditions on degrees and n...
AbstractLet Cl(n;d be the class of all directed graphsG, without loops and without multiple arcs, su...
AbstractIn this article we determine the maximum number of arcs of a strong diagraph of order n, wit...
AbstractAnswering a question of Adrian Bondy (Per. Comm.), we prove that every strong digraph has a ...
We consider the problem (MSSS) of finding the minimum number of arcs in a spanning strongly connecte...
AbstractIn this paper we present the upper and lower bounds of the longest directed cycle length for...
International audienceIn 1963, Tibor Gallai~\cite{TG} asked whether every strongly connected directe...
In 1963, Tibor Gallai [9] asked whether every strongly connected directed graph D is spanned by α di...
AbstractA digraph D is strong if it contains a directed path from x to y for every choice of vertice...
Given a k-arc-strong tournament T, we estimate the minimum number of arcs possible in a k-arc-strong...
AbstractThe classes of multidigraphs for which Ádám's conjecture (that any digraph containing a dire...
The so-called Kelly conjecture1 states that every regular tournament on 2k+1 vertices has a decompos...
AbstractJamison proved that every cycle of length greater than three in a graph has a chord—in other...
AbstractDans cet article nous déterminons le nombre minimum d'arcs assurant l'existence d'un circuit...
AbstractWe establish a directed analogue of Whtney's 2-switching theorem for graphs and apply it to ...
AbstractThe purpose of this communication is to announce some sufficient conditions on degrees and n...
AbstractLet Cl(n;d be the class of all directed graphsG, without loops and without multiple arcs, su...
AbstractIn this article we determine the maximum number of arcs of a strong diagraph of order n, wit...
DOI
Add to ORKG