AbstractA graph G with vertex set V(G) and edge set E(G) is pancyclic if it contains cycles of all lengths l, 3 ≤ l ≤ | V(G) |.Theorem. Let G be Hamiltonian and suppose that |E(G)| ≥ n24, where n = |V(G)|. Then G is either pancyclic or else is the complete bipartite graph Kn2,n2.As a corollary to this theorem it is shown that the Ore conditions for a graph to be Hamiltonian actually imply that the graph is either pancyclic or else is Kn2, n2
AbstractLet G be a graph of order n. A graph G is called pancyclic if it contains a cycle of length ...
Clark proved that L(G) is hamiltonian if G is a connected graph of order n ≥ 6 such that deg u + deg...
AbstractWe prove the following theorem. If G is a hamiltonian, nonbipartite graph of minimum degree ...
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 ...
We first show that if a 2-connected graph G of order n is such that for each two vertices u and v su...
AbstractIn this paper, we prove the following two theorems: (1) If G is a hamiltonian graph of order...
AbstractA celebrated theorem of Chvátal and Erdős says that G is Hamiltonian if κ(G)⩾α(G), where κ(G...
AbstractWe prove the following theorem. If G is a hamiltonian, nonbipartite graph of minimum degree ...
Asratian and Khachatrian proved that a connected graphG of order at least 3 is hamiltonian ifd(u) + ...
AbstractA graph on n vertices is called pancyclic if it contains a cycle of length ℓ for all 3≤ℓ≤n. ...
Asratian and Khachatrian proved that a connected graphG of order at least 3 is hamiltonian ifd(u) + ...
. Schmeichel and Hakimi [?], and Bauer and Schmeichel [?] gave an evidence in support of the well-kn...
AbstractWe use a recent cycle structure theorem to prove that three well-known hamiltonian degree co...
AbstractA graph G is pancyclic if it contains a k-cycle for k = 3,4,…,|V(G)|. In this paper we show ...
AbstractLet G be a graph of order n. A graph G is called pancyclic if it contains a cycle of length ...
Clark proved that L(G) is hamiltonian if G is a connected graph of order n ≥ 6 such that deg u + deg...
AbstractWe prove the following theorem. If G is a hamiltonian, nonbipartite graph of minimum degree ...
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 ...
We first show that if a 2-connected graph G of order n is such that for each two vertices u and v su...
AbstractIn this paper, we prove the following two theorems: (1) If G is a hamiltonian graph of order...
AbstractA celebrated theorem of Chvátal and Erdős says that G is Hamiltonian if κ(G)⩾α(G), where κ(G...
AbstractWe prove the following theorem. If G is a hamiltonian, nonbipartite graph of minimum degree ...
Asratian and Khachatrian proved that a connected graphG of order at least 3 is hamiltonian ifd(u) + ...
AbstractA graph on n vertices is called pancyclic if it contains a cycle of length ℓ for all 3≤ℓ≤n. ...
Asratian and Khachatrian proved that a connected graphG of order at least 3 is hamiltonian ifd(u) + ...
. Schmeichel and Hakimi [?], and Bauer and Schmeichel [?] gave an evidence in support of the well-kn...
AbstractWe use a recent cycle structure theorem to prove that three well-known hamiltonian degree co...
AbstractA graph G is pancyclic if it contains a k-cycle for k = 3,4,…,|V(G)|. In this paper we show ...
AbstractLet G be a graph of order n. A graph G is called pancyclic if it contains a cycle of length ...
Clark proved that L(G) is hamiltonian if G is a connected graph of order n ≥ 6 such that deg u + deg...
AbstractWe prove the following theorem. If G is a hamiltonian, nonbipartite graph of minimum degree ...
DOI
Add to ORKG