AbstractWe show that for each integerk⩾3, there exists an integerpksuch that every graph with minimum degree at least 2kand order at leastpkcontainskpairwise vertex-disjoint cycles of the same length
AbstractWe show that each finite undirected graph G = (V, E), |V| = n, |E|= m with minimum degree δ(...
AbstractN. Alon [J. Graph Theory 10 (1986), 123–127] proved that if the minimum degree of a graph G ...
AbstractLet G be a 2-connected bipartite graph with bipartition (A, B), where |A| ≥ |B|. It is shown...
Corradi and Hajnal proved that a graph of order at least 3k and minimum degree at least 2k contains ...
AbstractIt is shown that there exists a positiveεso that for any integerk, every directed graph with...
AbstractLet G be a graph of order at least 3k, where k is a positive integer. Justesen (Ann. Disc. M...
AbstractLetG=(V1, V2; E) be a bipartite graph with |V1|=|V2|=n⩾2k, wherekis a positive integer. Supp...
AbstractWe show that each finite undirected graph G = (V, E), |V| = n, |E|= m with minimum degree δ(...
AbstractLet G=(V1,V2;E) be a bipartite graph with |V1|=|V2|=n⩾4. Suppose that d(x)+d(y)⩾n+2 for all ...
International audienceIn this paper, we study the question of finding a set of $k$ vertex-disjoint c...
AbstractLet n,h be integers with n⩾6 and h⩾7. We prove that if G is a graph of order n with σ2(G)⩾h,...
AbstractWe show that for all positive ε, an integer N(ε) exists such that if G is any graph of order...
AbstractFor k an integer, let G(a, b, k) denote a simple bipartite graph with bipartition (A, B) whe...
AbstractWe propose the following conjecture to generalize results of Pósa and of Corrádi and Hajnal....
AbstractIn a recent paper, Bessy, Sereni and the author (see [3]) have proved that for r≥1, a tourna...
AbstractWe show that each finite undirected graph G = (V, E), |V| = n, |E|= m with minimum degree δ(...
AbstractN. Alon [J. Graph Theory 10 (1986), 123–127] proved that if the minimum degree of a graph G ...
AbstractLet G be a 2-connected bipartite graph with bipartition (A, B), where |A| ≥ |B|. It is shown...
Corradi and Hajnal proved that a graph of order at least 3k and minimum degree at least 2k contains ...
AbstractIt is shown that there exists a positiveεso that for any integerk, every directed graph with...
AbstractLet G be a graph of order at least 3k, where k is a positive integer. Justesen (Ann. Disc. M...
AbstractLetG=(V1, V2; E) be a bipartite graph with |V1|=|V2|=n⩾2k, wherekis a positive integer. Supp...
AbstractWe show that each finite undirected graph G = (V, E), |V| = n, |E|= m with minimum degree δ(...
AbstractLet G=(V1,V2;E) be a bipartite graph with |V1|=|V2|=n⩾4. Suppose that d(x)+d(y)⩾n+2 for all ...
International audienceIn this paper, we study the question of finding a set of $k$ vertex-disjoint c...
AbstractLet n,h be integers with n⩾6 and h⩾7. We prove that if G is a graph of order n with σ2(G)⩾h,...
AbstractWe show that for all positive ε, an integer N(ε) exists such that if G is any graph of order...
AbstractFor k an integer, let G(a, b, k) denote a simple bipartite graph with bipartition (A, B) whe...
AbstractWe propose the following conjecture to generalize results of Pósa and of Corrádi and Hajnal....
AbstractIn a recent paper, Bessy, Sereni and the author (see [3]) have proved that for r≥1, a tourna...
AbstractWe show that each finite undirected graph G = (V, E), |V| = n, |E|= m with minimum degree δ(...
AbstractN. Alon [J. Graph Theory 10 (1986), 123–127] proved that if the minimum degree of a graph G ...
AbstractLet G be a 2-connected bipartite graph with bipartition (A, B), where |A| ≥ |B|. It is shown...
DOI
Add to ORKG