AbstractWe use a recent cycle structure theorem to prove that three well-known hamiltonian degree conditions (due to Chvátal, Fan, and Bondy) each imply that a graph is either pancyclic, bipartite, or a member of an easily identified family of exceptions
AbstractA graph on n vertices is called pancyclic if it contains a cycle of length ℓ for all 3≤ℓ≤n. ...
AbstractWe prove the following theorem. LetGbe a graph of ordernand letW⊆V(G). If |W|⩾3 anddG(x)+dG(...
AbstractWe show that a strongly connected digraph with n vertices and minimum degree ⩾ n is pancycli...
AbstractA graph G with vertex set V(G) and edge set E(G) is pancyclic if it contains cycles of all l...
AbstractA graph G is pancyclic if it contains a k-cycle for k = 3,4,…,|V(G)|. In this paper we show ...
AbstractWe prove the following theorem. If G is a hamiltonian, nonbipartite graph of minimum degree ...
AbstractA graph G of order n is said to be in the class O(n − 1) if deg(u) + deg(ʋ) ⩾ n − 1 for ever...
AbstractA celebrated theorem of Chvátal and Erdős says that G is Hamiltonian if κ(G)⩾α(G), where κ(G...
AbstractA celebrated theorem of Chvátal and Erdős says that G is Hamiltonian if κ(G)⩾α(G), where κ(G...
. Schmeichel and Hakimi [?], and Bauer and Schmeichel [?] gave an evidence in support of the well-kn...
Let f(n) be the smallest integer such that for every graph G of order n with minimum degree 3(G)>f(n...
AbstractA graph G with vertex set V(G) and edge set E(G) is pancyclic if it contains cycles of all l...
AbstractA graph G is pancyclic if it contains a k-cycle for k = 3,4,…,|V(G)|. In this paper we show ...
An $n$-vertex graph is Hamiltonian if it contains a cycle that covers all of its vertices, and it is...
AbstractWe investigate the set of cycle lengths occurring in a hamiltonian graph with at least one o...
AbstractA graph on n vertices is called pancyclic if it contains a cycle of length ℓ for all 3≤ℓ≤n. ...
AbstractWe prove the following theorem. LetGbe a graph of ordernand letW⊆V(G). If |W|⩾3 anddG(x)+dG(...
AbstractWe show that a strongly connected digraph with n vertices and minimum degree ⩾ n is pancycli...
AbstractA graph G with vertex set V(G) and edge set E(G) is pancyclic if it contains cycles of all l...
AbstractA graph G is pancyclic if it contains a k-cycle for k = 3,4,…,|V(G)|. In this paper we show ...
AbstractWe prove the following theorem. If G is a hamiltonian, nonbipartite graph of minimum degree ...
AbstractA graph G of order n is said to be in the class O(n − 1) if deg(u) + deg(ʋ) ⩾ n − 1 for ever...
AbstractA celebrated theorem of Chvátal and Erdős says that G is Hamiltonian if κ(G)⩾α(G), where κ(G...
AbstractA celebrated theorem of Chvátal and Erdős says that G is Hamiltonian if κ(G)⩾α(G), where κ(G...
. Schmeichel and Hakimi [?], and Bauer and Schmeichel [?] gave an evidence in support of the well-kn...
Let f(n) be the smallest integer such that for every graph G of order n with minimum degree 3(G)>f(n...
AbstractA graph G with vertex set V(G) and edge set E(G) is pancyclic if it contains cycles of all l...
AbstractA graph G is pancyclic if it contains a k-cycle for k = 3,4,…,|V(G)|. In this paper we show ...
An $n$-vertex graph is Hamiltonian if it contains a cycle that covers all of its vertices, and it is...
AbstractWe investigate the set of cycle lengths occurring in a hamiltonian graph with at least one o...
AbstractA graph on n vertices is called pancyclic if it contains a cycle of length ℓ for all 3≤ℓ≤n. ...
AbstractWe prove the following theorem. LetGbe a graph of ordernand letW⊆V(G). If |W|⩾3 anddG(x)+dG(...
AbstractWe show that a strongly connected digraph with n vertices and minimum degree ⩾ n is pancycli...
DOI
Add to ORKG