Topics
Hamiltonian graphPlace
We prove that every Hamiltonian graph with n vertices and m edges has cycles of at least 4 7(m − n) different lengths. The coefficient 4/7 cannot be increased above 1, since when m = n2/4 there are m − n + 1 cycle lengths in Kn/2,n/2. For general m and n there are examples having at most
The problem studied in this paper is that of finding the maximum number of Hamiltonian cycles in a g...
We show how to find in Hamiltonian graphs a cycle of length nΩ(1 / log logn). This is a consequence ...
AbstractThe first result states that every 4-connected graph G with minimum degree δ and connectivit...
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...
AbstractWe prove that every Hamiltonian graph with n vertices and m edges has cycles with more than ...
In 1999, Jacobson and Lehel conjectured that, for k >= 3, every k-regular Hamiltonian graph has cycl...
AbstractLet G be a hamiltonian graph G of order n and maximum degree Δ, and let C(G) denote the set ...
AbstractWe investigate the set of cycle lengths occurring in a hamiltonian graph with at least one o...
AbstractWe study the set of cycle lengths in a hamiltonian graph G of order n with two fixed and non...
AbstractLet M(k) denote the maximum number of cycles in a Hamiltonian graph of order n and size n+k....
This thesis contains several new results about cycle spectra of graphs. The cycle spectrum of a grap...
The problem studied in this paper is that of finding the maximum number of Hamiltonian cycles in a g...
It is conjectured that every fullerene graph is hamiltonian. Jendrol ’ and Owens proved [J. Math. Ch...
The problem studied in this paper is that of finding the maximum number of Hamiltonian cycles in a g...
The problem studied in this paper is that of finding the maximum number of Hamiltonian cycles in a g...
We show how to find in Hamiltonian graphs a cycle of length nΩ(1 / log logn). This is a consequence ...
AbstractThe first result states that every 4-connected graph G with minimum degree δ and connectivit...
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...
AbstractWe prove that every Hamiltonian graph with n vertices and m edges has cycles with more than ...
In 1999, Jacobson and Lehel conjectured that, for k >= 3, every k-regular Hamiltonian graph has cycl...
AbstractLet G be a hamiltonian graph G of order n and maximum degree Δ, and let C(G) denote the set ...
AbstractWe investigate the set of cycle lengths occurring in a hamiltonian graph with at least one o...
AbstractWe study the set of cycle lengths in a hamiltonian graph G of order n with two fixed and non...
AbstractLet M(k) denote the maximum number of cycles in a Hamiltonian graph of order n and size n+k....
This thesis contains several new results about cycle spectra of graphs. The cycle spectrum of a grap...
The problem studied in this paper is that of finding the maximum number of Hamiltonian cycles in a g...
It is conjectured that every fullerene graph is hamiltonian. Jendrol ’ and Owens proved [J. Math. Ch...
The problem studied in this paper is that of finding the maximum number of Hamiltonian cycles in a g...
The problem studied in this paper is that of finding the maximum number of Hamiltonian cycles in a g...
We show how to find in Hamiltonian graphs a cycle of length nΩ(1 / log logn). This is a consequence ...
AbstractThe first result states that every 4-connected graph G with minimum degree δ and connectivit...
Add to ORKG