AbstractLet D be an arc-3-cyclic, semicomplete digraph and uv be an arc of D contained in a cycle of length r. If vu ∉ A(D) then the arc uv is contained in cycles of length h : 3 ⩽ h ⩽ r, or if δ+(D), δ−(D) ⩾ 3 then the arc uv is contained in cycles of length h : 6 ⩽ h ⩽ r. Also included in this paper is a very useful crossing arc theorem
AbstractIn this paper we collect a substantial number of challenging open problems and conjectures o...
AbstractB. Alspach has proved that a regular tournament is arc-pancyclic. Zhu and Tian proved that i...
AbstractIf x is a vertex of a digraph D, then we denote by d+(x) and d−(x) the outdegree and the ind...
AbstractLet D be an arc-3-cyclic, semicomplete digraph and uv be an arc of D contained in a cycle of...
AbstractLet G = (V,A) be a digraph of order n. Digraph G is said to be arc-k-cyclic if each arc of G...
A digraph D is called semicomplete if for each pair of distinct vertices u, v {dollar}\\in{dollar} V...
AbstractA digraph obtained by replacing each edge of a complete n-partite graph by an arc or a pair ...
AbstractArc-locally semicomplete digraphs were introduced in (Preprint, No. 10, 1993, Department of ...
International audienceA digraph is eulerian if it is connected and every vertex has its in-degree eq...
Let D = (V,A) be a digraph; if there is at least one arc between every pair of distinct vertices of ...
AbstractAn outpath of a vertex x (an arc xy, respectively) in a digraph is a directed path starting ...
AbstractA digraph is arc-locally in-semicomplete if for any pair of adjacent vertices x,y, every in-...
AbstractArc-locally semicomplete digraphs were introduced by Bang-Jensen as a common generalization ...
AbstractIf every arc of a 3-connected tournament T is contained in a cycle of length 3, then every a...
Recently, Huang (1995) gave a characterization of local tournaments. His characterization involves a...
AbstractIn this paper we collect a substantial number of challenging open problems and conjectures o...
AbstractB. Alspach has proved that a regular tournament is arc-pancyclic. Zhu and Tian proved that i...
AbstractIf x is a vertex of a digraph D, then we denote by d+(x) and d−(x) the outdegree and the ind...
AbstractLet D be an arc-3-cyclic, semicomplete digraph and uv be an arc of D contained in a cycle of...
AbstractLet G = (V,A) be a digraph of order n. Digraph G is said to be arc-k-cyclic if each arc of G...
A digraph D is called semicomplete if for each pair of distinct vertices u, v {dollar}\\in{dollar} V...
AbstractA digraph obtained by replacing each edge of a complete n-partite graph by an arc or a pair ...
AbstractArc-locally semicomplete digraphs were introduced in (Preprint, No. 10, 1993, Department of ...
International audienceA digraph is eulerian if it is connected and every vertex has its in-degree eq...
Let D = (V,A) be a digraph; if there is at least one arc between every pair of distinct vertices of ...
AbstractAn outpath of a vertex x (an arc xy, respectively) in a digraph is a directed path starting ...
AbstractA digraph is arc-locally in-semicomplete if for any pair of adjacent vertices x,y, every in-...
AbstractArc-locally semicomplete digraphs were introduced by Bang-Jensen as a common generalization ...
AbstractIf every arc of a 3-connected tournament T is contained in a cycle of length 3, then every a...
Recently, Huang (1995) gave a characterization of local tournaments. His characterization involves a...
AbstractIn this paper we collect a substantial number of challenging open problems and conjectures o...
AbstractB. Alspach has proved that a regular tournament is arc-pancyclic. Zhu and Tian proved that i...
AbstractIf x is a vertex of a digraph D, then we denote by d+(x) and d−(x) the outdegree and the ind...