DOIAbstract
AbstractWe prove that a strong digraph of order n and such that, for each pair of non adjacent vertices, the degree sum is at least 2n − 1, is pancyclic with some exceptions
AbstractWe prove that a strong digraph of order n and such that, for each pair of non adjacent vertices, the degree sum is at least 2n − 1, is pancyclic with some exceptions
Over the years Hamiltonian graphs have been widely studied. Various Hamiltonian-related properties h...
A tournament is a digraph, where there is precisely one arc between every pair of distinct vertices....
AbstractA graph G on n vertices is called subpancyclic if it contains cycles of every length k with ...
AbstractWe prove that a strong digraph of order n and such that, for each pair of non adjacent verti...
AbstractA strongly connected digraphGwithnvertices satisfying the condition that the sum of degrees ...
AbstractWe show that a strongly connected digraph with n vertices and minimum degree ⩾ n is pancycli...
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...
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 ...
AbstractLet G be a graph and S a subset of V(G). Let α(S) denote the maximum number of pairwise nona...
Say that a cycle C almost contains a cycle C¯ if every edge except one of C¯ is an edge of C. Call a...
AbstractLet G be a 2-connected bipartite balanced graph of order 2n and bipartition (X,Y). Let S be ...
AbstractWe prove the following theorem. LetGbe a graph of ordernand letW⊆V(G). If |W|⩾3 anddG(x)+dG(...
AbstractA graph G of order n is said to be in the class O(n − 1) if deg(u) + deg(ʋ) ⩾ n − 1 for ever...
AbstractLet G be a graph of order n. A graph G is called pancyclic if it contains a cycle of length ...
Over the years Hamiltonian graphs have been widely studied. Various Hamiltonian-related properties h...
A tournament is a digraph, where there is precisely one arc between every pair of distinct vertices....
AbstractA graph G on n vertices is called subpancyclic if it contains cycles of every length k with ...
AbstractWe prove that a strong digraph of order n and such that, for each pair of non adjacent verti...
AbstractA strongly connected digraphGwithnvertices satisfying the condition that the sum of degrees ...
AbstractWe show that a strongly connected digraph with n vertices and minimum degree ⩾ n is pancycli...
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...
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 ...
AbstractLet G be a graph and S a subset of V(G). Let α(S) denote the maximum number of pairwise nona...
Say that a cycle C almost contains a cycle C¯ if every edge except one of C¯ is an edge of C. Call a...
AbstractLet G be a 2-connected bipartite balanced graph of order 2n and bipartition (X,Y). Let S be ...
AbstractWe prove the following theorem. LetGbe a graph of ordernand letW⊆V(G). If |W|⩾3 anddG(x)+dG(...
AbstractA graph G of order n is said to be in the class O(n − 1) if deg(u) + deg(ʋ) ⩾ n − 1 for ever...
AbstractLet G be a graph of order n. A graph G is called pancyclic if it contains a cycle of length ...
Over the years Hamiltonian graphs have been widely studied. Various Hamiltonian-related properties h...
A tournament is a digraph, where there is precisely one arc between every pair of distinct vertices....
AbstractA graph G on n vertices is called subpancyclic if it contains cycles of every length k with ...
Add to ORKG