AbstractWe prove that every Hamiltonian graph with n vertices and m edges has cycles with more than p−12lnp−1 different lengths, where p=m−n. For general m and n, there exist such graphs having at most 2⌈p+1⌉ different cycle lengths
Komlós conjectured in 1981 that among all graphs with minimum degree at least d, the complete graph ...
AbstractA graph G is pancyclic if it contains a k-cycle for k = 3,4,…,|V(G)|. In this paper we show ...
It is known that Θ(log n) chords must be added to an n-cycle to produce a pancyclic graph; for verte...
AbstractWe prove that every Hamiltonian graph with n vertices and m edges has cycles with more than ...
We prove that every Hamiltonian graph with n vertices and m edges has cycles with more than p − 12 l...
We prove that every Hamiltonian graph with n vertices and m edges has cycles of at least 4 7(m − n) ...
AbstractWe investigate the set of cycle lengths occurring in a hamiltonian graph with at least one o...
In 1999, Jacobson and Lehel conjectured that, for k >= 3, every k-regular Hamiltonian graph has cycl...
AbstractWe study the set of cycle lengths in a hamiltonian graph G of order n with two fixed and non...
AbstractA graph G with vertex set V(G) and edge set E(G) is pancyclic if it contains cycles of all l...
An $n$-vertex graph is Hamiltonian if it contains a cycle that covers all of its vertices, and it is...
AbstractWe use a recent cycle structure theorem to prove that three well-known hamiltonian degree co...
AbstractWe investigate the set of cycle lengths occurring in a hamiltonian graph with at least one o...
AbstractWe show that for all positive ε, an integer N(ε) exists such that if G is any graph of order...
It is known that Θ(log n) chords must be added to an n-cycle to produce a pancyclic graph; for verte...
Komlós conjectured in 1981 that among all graphs with minimum degree at least d, the complete graph ...
AbstractA graph G is pancyclic if it contains a k-cycle for k = 3,4,…,|V(G)|. In this paper we show ...
It is known that Θ(log n) chords must be added to an n-cycle to produce a pancyclic graph; for verte...
AbstractWe prove that every Hamiltonian graph with n vertices and m edges has cycles with more than ...
We prove that every Hamiltonian graph with n vertices and m edges has cycles with more than p − 12 l...
We prove that every Hamiltonian graph with n vertices and m edges has cycles of at least 4 7(m − n) ...
AbstractWe investigate the set of cycle lengths occurring in a hamiltonian graph with at least one o...
In 1999, Jacobson and Lehel conjectured that, for k >= 3, every k-regular Hamiltonian graph has cycl...
AbstractWe study the set of cycle lengths in a hamiltonian graph G of order n with two fixed and non...
AbstractA graph G with vertex set V(G) and edge set E(G) is pancyclic if it contains cycles of all l...
An $n$-vertex graph is Hamiltonian if it contains a cycle that covers all of its vertices, and it is...
AbstractWe use a recent cycle structure theorem to prove that three well-known hamiltonian degree co...
AbstractWe investigate the set of cycle lengths occurring in a hamiltonian graph with at least one o...
AbstractWe show that for all positive ε, an integer N(ε) exists such that if G is any graph of order...
It is known that Θ(log n) chords must be added to an n-cycle to produce a pancyclic graph; for verte...
Komlós conjectured in 1981 that among all graphs with minimum degree at least d, the complete graph ...
AbstractA graph G is pancyclic if it contains a k-cycle for k = 3,4,…,|V(G)|. In this paper we show ...
It is known that Θ(log n) chords must be added to an n-cycle to produce a pancyclic graph; for verte...
DOI
Add to ORKG