Let f(n) be the smallest integer such that for every graph G of order n with minimum degree 3(G)>f(n), the line graph L(G) of G is pancyclic whenever L(G) is hamiltonian. Results are proved showing that f(n) = ®(n 1/3)
Clark proved that L(G) is hamiltonian if G is a connected graph of order n ≥ 6 such that deg u + deg...
AbstractA graph G on n vertices is called subpancyclic if it contains cycles of every length k with ...
AbstractIn this paper, we prove the following two theorems: (1) If G is a hamiltonian graph of order...
AbstractLet f(n) be the smallest integer such that for every graph G of order n with minimum degree ...
Let f(n) be the smallest integer such that for every graph G of order n with minimum degree 3(G)>f(n...
AbstractWe prove the following theorem. If G is a hamiltonian, nonbipartite graph of minimum degree ...
AbstractA celebrated theorem of Chvátal and Erdős says that G is Hamiltonian if κ(G)⩾α(G), where κ(G...
AbstractA graph on n vertices is called pancyclic if it contains a cycle of length ℓ for all 3≤ℓ≤n. ...
AbstractIn this paper, two best possible edge degree conditions are given for the line graph L(G) of...
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...
We first show that if a 2-connected graph G of order n is such that for each two vertices u and v su...
A graph G on n vertices is called subpancyclic if it contains cycles of every length k with 3 ≤ k ≤ ...
A graph G on n vertices is called subpancyclic if it contains cycles of every length k with 3 ≤ k ≤ ...
Clark proved that L(G) is hamiltonian if G is a connected graph of order n 2 6 such that deg u + deg...
Clark proved that L(G) is hamiltonian if G is a connected graph of order n ≥ 6 such that deg u + deg...
AbstractA graph G on n vertices is called subpancyclic if it contains cycles of every length k with ...
AbstractIn this paper, we prove the following two theorems: (1) If G is a hamiltonian graph of order...
AbstractLet f(n) be the smallest integer such that for every graph G of order n with minimum degree ...
Let f(n) be the smallest integer such that for every graph G of order n with minimum degree 3(G)>f(n...
AbstractWe prove the following theorem. If G is a hamiltonian, nonbipartite graph of minimum degree ...
AbstractA celebrated theorem of Chvátal and Erdős says that G is Hamiltonian if κ(G)⩾α(G), where κ(G...
AbstractA graph on n vertices is called pancyclic if it contains a cycle of length ℓ for all 3≤ℓ≤n. ...
AbstractIn this paper, two best possible edge degree conditions are given for the line graph L(G) of...
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...
We first show that if a 2-connected graph G of order n is such that for each two vertices u and v su...
A graph G on n vertices is called subpancyclic if it contains cycles of every length k with 3 ≤ k ≤ ...
A graph G on n vertices is called subpancyclic if it contains cycles of every length k with 3 ≤ k ≤ ...
Clark proved that L(G) is hamiltonian if G is a connected graph of order n 2 6 such that deg u + deg...
Clark proved that L(G) is hamiltonian if G is a connected graph of order n ≥ 6 such that deg u + deg...
AbstractA graph G on n vertices is called subpancyclic if it contains cycles of every length k with ...
AbstractIn this paper, we prove the following two theorems: (1) If G is a hamiltonian graph of order...
DOI
Add to ORKG