AbstractA strongly connected digraphGwithnvertices satisfying the condition that the sum of degrees for any two nonadjacent vertices is at least 2nis pancyclic unlessGis a tournament ornis even and G=K→n2n
AbstractA celebrated theorem of Chvátal and Erdős says that G is Hamiltonian if κ(G)⩾α(G), where κ(G...
Over the years Hamiltonian graphs have been widely studied. Various Hamiltonian-related properties h...
AbstractLetD=(V, E) be a digraph with vertex setVof sizenand arc setE. Foru∈V, letd(u) denote the de...
AbstractWe prove that a strong digraph of order n and such that, for each pair of non adjacent verti...
AbstractWe show that a strongly connected digraph with n vertices and minimum degree ⩾ n is pancycli...
AbstractA strongly connected digraphGwithnvertices satisfying the condition that the sum of degrees ...
AbstractWe prove the theorem: Let G = (X, U) be an oriented strongly connected graph with n(≥2) vert...
AbstractWe prove the following theorem. If G is a hamiltonian, nonbipartite graph of minimum degree ...
AbstractWe use a recent cycle structure theorem to prove that three well-known hamiltonian degree co...
AbstractA graph G of order n is said to be in the class O(n − 1) if deg(u) + deg(ʋ) ⩾ n − 1 for ever...
Hamiltonian graph theory has been widely studied as one of the most important problems in graph theo...
AbstractA graph G with vertex set V(G) and edge set E(G) is pancyclic if it contains cycles of all l...
AbstractAn in-tournament is a loopless digraph without multiple arcs and cycles of length 2 such tha...
AbstractLet G be a graph of order n and S a subset of V(G). We define G to be S-pancyclable if for e...
We describe a new type of sufficient condition for a digraph to be Hamiltonian. Conditions of this t...
AbstractA celebrated theorem of Chvátal and Erdős says that G is Hamiltonian if κ(G)⩾α(G), where κ(G...
Over the years Hamiltonian graphs have been widely studied. Various Hamiltonian-related properties h...
AbstractLetD=(V, E) be a digraph with vertex setVof sizenand arc setE. Foru∈V, letd(u) denote the de...
AbstractWe prove that a strong digraph of order n and such that, for each pair of non adjacent verti...
AbstractWe show that a strongly connected digraph with n vertices and minimum degree ⩾ n is pancycli...
AbstractA strongly connected digraphGwithnvertices satisfying the condition that the sum of degrees ...
AbstractWe prove the theorem: Let G = (X, U) be an oriented strongly connected graph with n(≥2) vert...
AbstractWe prove the following theorem. If G is a hamiltonian, nonbipartite graph of minimum degree ...
AbstractWe use a recent cycle structure theorem to prove that three well-known hamiltonian degree co...
AbstractA graph G of order n is said to be in the class O(n − 1) if deg(u) + deg(ʋ) ⩾ n − 1 for ever...
Hamiltonian graph theory has been widely studied as one of the most important problems in graph theo...
AbstractA graph G with vertex set V(G) and edge set E(G) is pancyclic if it contains cycles of all l...
AbstractAn in-tournament is a loopless digraph without multiple arcs and cycles of length 2 such tha...
AbstractLet G be a graph of order n and S a subset of V(G). We define G to be S-pancyclable if for e...
We describe a new type of sufficient condition for a digraph to be Hamiltonian. Conditions of this t...
AbstractA celebrated theorem of Chvátal and Erdős says that G is Hamiltonian if κ(G)⩾α(G), where κ(G...
Over the years Hamiltonian graphs have been widely studied. Various Hamiltonian-related properties h...
AbstractLetD=(V, E) be a digraph with vertex setVof sizenand arc setE. Foru∈V, letd(u) denote the de...
DOI