AbstractWe describe an infinite class of digraphs with the property that the reversal of any arc increases the length of a longest directed cycle and we use this to disprove the conjecture of Adám than any digraph containing a directed cycle has an arc whose reversal decreases the total number of directed cycles
We prove that every tournament T=(V,A) on n2k+1 vertices can be made k-arc-strong by reversing no mo...
AbstractThe purpose of this communication is to announce some sufficient conditions on degrees and n...
An $s$-arc in a digraph $\Gamma$ is a sequence $v_0,v_1,\ldots,v_s$ of vertices such that for each $...
A. Ádám conjectured that for any non-acyclic digraph D, there exists an arc whose reversal reduces t...
AbstractThe classes of multidigraphs for which Ádám's conjecture (that any digraph containing a dire...
AbstractIn this note we consider closed walks, which are cycles that are not necessarily elementary....
AbstractThis paper deals with increasing the arc-connectivity of directed graphs by arc additions, r...
AbstractLet D be an arc-3-cyclic, semicomplete digraph and uv be an arc of D contained in a cycle of...
This paper deals with increasing the arc-connectivity of directed graphs by arc additions, reversals...
AbstractWe discuss when two tournaments defined on the same set of n vertices are equivalent under a...
AbstractWe establish a directed analogue of Whtney's 2-switching theorem for graphs and apply it to ...
AbstractGiven a digraph G and a sufficiently long directed path P, a folklore result says that G is ...
AbstractIn this paper we present the upper and lower bounds of the longest directed cycle length for...
summary:The arc graph $\delta(G)$ of a digraph $G$ is the digraph with the set of arcs of $G$ as ver...
In a directed graph, the imbalance of a vertex v is b(v) = d + (v) − d − (v). We charac-terize the...
We prove that every tournament T=(V,A) on n2k+1 vertices can be made k-arc-strong by reversing no mo...
AbstractThe purpose of this communication is to announce some sufficient conditions on degrees and n...
An $s$-arc in a digraph $\Gamma$ is a sequence $v_0,v_1,\ldots,v_s$ of vertices such that for each $...
A. Ádám conjectured that for any non-acyclic digraph D, there exists an arc whose reversal reduces t...
AbstractThe classes of multidigraphs for which Ádám's conjecture (that any digraph containing a dire...
AbstractIn this note we consider closed walks, which are cycles that are not necessarily elementary....
AbstractThis paper deals with increasing the arc-connectivity of directed graphs by arc additions, r...
AbstractLet D be an arc-3-cyclic, semicomplete digraph and uv be an arc of D contained in a cycle of...
This paper deals with increasing the arc-connectivity of directed graphs by arc additions, reversals...
AbstractWe discuss when two tournaments defined on the same set of n vertices are equivalent under a...
AbstractWe establish a directed analogue of Whtney's 2-switching theorem for graphs and apply it to ...
AbstractGiven a digraph G and a sufficiently long directed path P, a folklore result says that G is ...
AbstractIn this paper we present the upper and lower bounds of the longest directed cycle length for...
summary:The arc graph $\delta(G)$ of a digraph $G$ is the digraph with the set of arcs of $G$ as ver...
In a directed graph, the imbalance of a vertex v is b(v) = d + (v) − d − (v). We charac-terize the...
We prove that every tournament T=(V,A) on n2k+1 vertices can be made k-arc-strong by reversing no mo...
AbstractThe purpose of this communication is to announce some sufficient conditions on degrees and n...
An $s$-arc in a digraph $\Gamma$ is a sequence $v_0,v_1,\ldots,v_s$ of vertices such that for each $...
DOI
Add to ORKG