DOIAbstract
AbstractNew upper and lower bounds are found for the number of Hamiltonian circuits in the graph of the n-cube
AbstractNew upper and lower bounds are found for the number of Hamiltonian circuits in the graph of the n-cube
AbstractThe main results assert that the minimum number of Hamiltonian bypasses in a strong tourname...
International audienceWe present superfactorial and exponential lower bounds on the number of Hamilt...
AbstractAssume that n and δ are positive integers with 3≤δ<n. Let hc(n,δ) be the minimum number of e...
AbstractNew upper and lower bounds are found for the number of Hamiltonian circuits in the graph of ...
AbstractG = 〈V(G), E(G)〉 denotes a directed graph without loops and multiple arrows. K(G) denotes th...
AbstractAn explicit formula and an asymptotic formula are obtained for the number of labeled Hamilto...
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...
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...
The problem studied in this paper is that of finding the maximum number of Hamiltonian cycles in a g...
AbstractThe probability that a random graph with n vertices and cn log n edges contains a Hamiltonia...
AbstractA graph G of order p ⩾ 3 is called n-hamiltonian, 0 ⩽ n ⩽ p − 3, if the removal of any m ver...
AbstractSmith's theorem states that in a cubic graph the number of Hamiltonian cycles containing a g...
We give new upper and lower bounds for the number of Hamiltonian cycles h(n) in the graph of the n-c...
AbstractThe main results assert that the minimum number of Hamiltonian bypasses in a strong tourname...
International audienceWe present superfactorial and exponential lower bounds on the number of Hamilt...
AbstractAssume that n and δ are positive integers with 3≤δ<n. Let hc(n,δ) be the minimum number of e...
AbstractNew upper and lower bounds are found for the number of Hamiltonian circuits in the graph of ...
AbstractG = 〈V(G), E(G)〉 denotes a directed graph without loops and multiple arrows. K(G) denotes th...
AbstractAn explicit formula and an asymptotic formula are obtained for the number of labeled Hamilto...
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...
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...
The problem studied in this paper is that of finding the maximum number of Hamiltonian cycles in a g...
AbstractThe probability that a random graph with n vertices and cn log n edges contains a Hamiltonia...
AbstractA graph G of order p ⩾ 3 is called n-hamiltonian, 0 ⩽ n ⩽ p − 3, if the removal of any m ver...
AbstractSmith's theorem states that in a cubic graph the number of Hamiltonian cycles containing a g...
We give new upper and lower bounds for the number of Hamiltonian cycles h(n) in the graph of the n-c...
AbstractThe main results assert that the minimum number of Hamiltonian bypasses in a strong tourname...
International audienceWe present superfactorial and exponential lower bounds on the number of Hamilt...
AbstractAssume that n and δ are positive integers with 3≤δ<n. Let hc(n,δ) be the minimum number of e...
Add to ORKG