AbstractIt is shown that there exists a positiveεso that for any integerk, every directed graph with minimum outdegree at leastkcontains at leastεkvertex disjoint cycles. On the other hand, for everykthere is a digraph with minimum outdegreekwhich does not contain two vertex or edge disjoint cycles of the same length
International audienceIn this paper, we study the question of finding a set of $k$ vertex-disjoint c...
International audienceIn this paper, we study the question of finding a set of $k$ vertex-disjoint c...
International audienceIn this paper, we study the question of finding a set of $k$ vertex-disjoint c...
AbstractIt is shown that there exists a positiveεso that for any integerk, every directed graph with...
AbstractWe show that for each integerk⩾3, there exists an integerpksuch that every graph with minimu...
International audienceIn 1981, Bermond and Thomassen conjectured that every digraph with minimum out...
AbstractCaccetta and Häggkvist [1] conjectured that every digraph with n vertices and minimum outdeg...
AbstractIt is proved that every directed graph with n vertices and minimum outdegree k contains a di...
AbstractLet G be a graph of order at least 3k, where k is a positive integer. Justesen (Ann. Disc. M...
Bermond and Thomassen conjectured that every digraph with minimum outdegree at least $2k-1$ contains...
AbstractWe show that every digraph D with minimum outdegree δ and maximum indegree Δ contains a dire...
International audienceIn this paper, we study the question of finding a set of $k$ vertex-disjoint c...
AbstractWe propose the following conjecture to generalize results of Pósa and of Corrádi and Hajnal....
AbstractIt is proved that a graph with n vertices and minimum degree at least [(h + 2)/2h]n contains...
International audienceIn this paper, we study the question of finding a set of $k$ vertex-disjoint c...
International audienceIn this paper, we study the question of finding a set of $k$ vertex-disjoint c...
International audienceIn this paper, we study the question of finding a set of $k$ vertex-disjoint c...
International audienceIn this paper, we study the question of finding a set of $k$ vertex-disjoint c...
AbstractIt is shown that there exists a positiveεso that for any integerk, every directed graph with...
AbstractWe show that for each integerk⩾3, there exists an integerpksuch that every graph with minimu...
International audienceIn 1981, Bermond and Thomassen conjectured that every digraph with minimum out...
AbstractCaccetta and Häggkvist [1] conjectured that every digraph with n vertices and minimum outdeg...
AbstractIt is proved that every directed graph with n vertices and minimum outdegree k contains a di...
AbstractLet G be a graph of order at least 3k, where k is a positive integer. Justesen (Ann. Disc. M...
Bermond and Thomassen conjectured that every digraph with minimum outdegree at least $2k-1$ contains...
AbstractWe show that every digraph D with minimum outdegree δ and maximum indegree Δ contains a dire...
International audienceIn this paper, we study the question of finding a set of $k$ vertex-disjoint c...
AbstractWe propose the following conjecture to generalize results of Pósa and of Corrádi and Hajnal....
AbstractIt is proved that a graph with n vertices and minimum degree at least [(h + 2)/2h]n contains...
International audienceIn this paper, we study the question of finding a set of $k$ vertex-disjoint c...
International audienceIn this paper, we study the question of finding a set of $k$ vertex-disjoint c...
International audienceIn this paper, we study the question of finding a set of $k$ vertex-disjoint c...
International audienceIn this paper, we study the question of finding a set of $k$ vertex-disjoint c...
DOI
Add to ORKG