Add to ORKGThe problem studied in this paper is that of finding the maximum number of Hamiltonian cycles in a graph with a given number of vertices and edges. The main results are a lower bound and an upper bound, both given by closed-form formulas, for the maximum number of Hamiltonian cycles in a graph with a given number of vertices and edges. (C) 2000 Elsevier Science B.V. All rights reserved
Abstract. We examine the problem of counting the number of Hamil-tonian paths and Hamiltonian cycles...
The Hamiltonian number of a connected graph is the minimum of the lengths of the closed spanning wal...
AbstractSharp exponential upper bound, k!n−1, on the number of hamiltonian k-sets (i.e., decompositi...
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...
AbstractLet M(k) denote the maximum number of cycles in a Hamiltonian graph of order n and size n+k....
AbstractLet G be a hamiltonian graph G of order n and maximum degree Δ, and let C(G) denote the set ...
We investigate the maximum number of simple cycles and the maximum number of Hamiltonian cycles in a...
AbstractG = 〈V(G), E(G)〉 denotes a directed graph without loops and multiple arrows. K(G) denotes th...
We investigate the maximum number of simple cycles and the maximum number of Hamiltonian cycles in a...
We investigate the maximum number of simple cycles and the maximum number of Hamiltonian cycles in a...
We investigate the maximum number of simple cycles and the maximum number of Hamiltonian cycles in a...
AbstractAssume that n and δ are positive integers with 3≤δ<n. Let hc(n,δ) be the minimum number of e...
Abstract. We examine the problem of counting the number of Hamil-tonian paths and Hamiltonian cycles...
The Hamiltonian number of a connected graph is the minimum of the lengths of the closed spanning wal...
AbstractSharp exponential upper bound, k!n−1, on the number of hamiltonian k-sets (i.e., decompositi...
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...
AbstractLet M(k) denote the maximum number of cycles in a Hamiltonian graph of order n and size n+k....
AbstractLet G be a hamiltonian graph G of order n and maximum degree Δ, and let C(G) denote the set ...
We investigate the maximum number of simple cycles and the maximum number of Hamiltonian cycles in a...
AbstractG = 〈V(G), E(G)〉 denotes a directed graph without loops and multiple arrows. K(G) denotes th...
We investigate the maximum number of simple cycles and the maximum number of Hamiltonian cycles in a...
We investigate the maximum number of simple cycles and the maximum number of Hamiltonian cycles in a...
We investigate the maximum number of simple cycles and the maximum number of Hamiltonian cycles in a...
AbstractAssume that n and δ are positive integers with 3≤δ<n. Let hc(n,δ) be the minimum number of e...
Abstract. We examine the problem of counting the number of Hamil-tonian paths and Hamiltonian cycles...
The Hamiltonian number of a connected graph is the minimum of the lengths of the closed spanning wal...
AbstractSharp exponential upper bound, k!n−1, on the number of hamiltonian k-sets (i.e., decompositi...