AbstractG = 〈V(G), E(G)〉 denotes a directed graph without loops and multiple arrows. K(G) denotes the set of all Hamiltonian circuits of G. Put H(n, r) = max{|E(G)|, |V(G)| = n, 1 ≤ |K(G)| ≤ r}. Theorem: H(n, 1) = (n22) + (n2) −1. Further, H(n, 2),…, H(n, 5) are given
AbstractNew upper and lower bounds are found for the number of Hamiltonian circuits in the graph of ...
AbstractA theorem is proved that is (in a sense) the best possible improvement on the following them...
AbstractA graph G of order p ⩾ 3 is called n-hamiltonian, 0 ⩽ n ⩽ p − 3, if the removal of any m ver...
AbstractLet M(k) denote the maximum number of cycles in a Hamiltonian graph of order n and size n+k....
AbstractNew upper and lower bounds are found for the number of Hamiltonian circuits in the graph of ...
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...
AbstractAssume that n and δ are positive integers with 3≤δ<n. Let hc(n,δ) be the minimum number of e...
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...
AbstractLet G be a hamiltonian graph G of order n and maximum degree Δ, and let C(G) denote the set ...
AbstractThe main results assert that the minimum number of Hamiltonian bypasses in a strong tourname...
AbstractSharp exponential upper bound, k!n−1, on the number of hamiltonian k-sets (i.e., decompositi...
Abstract. Let us fix a function f(n) = o(n lnn) and reals 0 ≤ α < β ≤ 1. We present a polynomial...
AbstractNew upper and lower bounds are found for the number of Hamiltonian circuits in the graph of ...
AbstractA theorem is proved that is (in a sense) the best possible improvement on the following them...
AbstractA graph G of order p ⩾ 3 is called n-hamiltonian, 0 ⩽ n ⩽ p − 3, if the removal of any m ver...
AbstractLet M(k) denote the maximum number of cycles in a Hamiltonian graph of order n and size n+k....
AbstractNew upper and lower bounds are found for the number of Hamiltonian circuits in the graph of ...
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...
AbstractAssume that n and δ are positive integers with 3≤δ<n. Let hc(n,δ) be the minimum number of e...
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...
AbstractLet G be a hamiltonian graph G of order n and maximum degree Δ, and let C(G) denote the set ...
AbstractThe main results assert that the minimum number of Hamiltonian bypasses in a strong tourname...
AbstractSharp exponential upper bound, k!n−1, on the number of hamiltonian k-sets (i.e., decompositi...
Abstract. Let us fix a function f(n) = o(n lnn) and reals 0 ≤ α < β ≤ 1. We present a polynomial...
AbstractNew upper and lower bounds are found for the number of Hamiltonian circuits in the graph of ...
AbstractA theorem is proved that is (in a sense) the best possible improvement on the following them...
AbstractA graph G of order p ⩾ 3 is called n-hamiltonian, 0 ⩽ n ⩽ p − 3, if the removal of any m ver...
DOI
Add to ORKG