Publication date
December 1977
DOI Publisher
Published by Elsevier B.V. ISSN
0012-365XAbstract
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
AbstractSmith's theorem states that in a cubic graph the number of Hamiltonian cycles containing a g...
AbstractA circuit code of dimension d and spread k is a simple circuit which is formed from the vert...
AbstractConsider the subset graph G(n,k) whose vertex set C(n,k) is the set of all n-tuples of ‘0's’...
AbstractNew upper and lower bounds are found for the number of Hamiltonian circuits in the graph of ...
We give new upper and lower bounds for the number of Hamiltonian cycles h(n) in the graph of the n-c...
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...
AbstractIn response to a question of Bondy, bounds are established on the minimum number of Hamilton...
AbstractThe main results assert that the minimum number of Hamiltonian bypasses in a strong tourname...
We present an algorithm for enumerating exactly the number of Hamiltonian chains on regular lattices...
We present an algorithm for enumerating exactly the number of Hamiltonian chains on regular lattices...
AbstractSmith's theorem states that in a cubic graph the number of Hamiltonian cycles containing a g...
AbstractSharp exponential upper bound, k!n−1, on the number of hamiltonian k-sets (i.e., decompositi...
We say that two graphs on the same vertex set are $G$-creating if their union (the union of their ed...
For a random tournament on $3^n$ vertices, the expected number of Hamiltonian cycles is known to be ...
AbstractSmith's theorem states that in a cubic graph the number of Hamiltonian cycles containing a g...
AbstractA circuit code of dimension d and spread k is a simple circuit which is formed from the vert...
AbstractConsider the subset graph G(n,k) whose vertex set C(n,k) is the set of all n-tuples of ‘0's’...
AbstractNew upper and lower bounds are found for the number of Hamiltonian circuits in the graph of ...
We give new upper and lower bounds for the number of Hamiltonian cycles h(n) in the graph of the n-c...
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...
AbstractIn response to a question of Bondy, bounds are established on the minimum number of Hamilton...
AbstractThe main results assert that the minimum number of Hamiltonian bypasses in a strong tourname...
We present an algorithm for enumerating exactly the number of Hamiltonian chains on regular lattices...
We present an algorithm for enumerating exactly the number of Hamiltonian chains on regular lattices...
AbstractSmith's theorem states that in a cubic graph the number of Hamiltonian cycles containing a g...
AbstractSharp exponential upper bound, k!n−1, on the number of hamiltonian k-sets (i.e., decompositi...
We say that two graphs on the same vertex set are $G$-creating if their union (the union of their ed...
For a random tournament on $3^n$ vertices, the expected number of Hamiltonian cycles is known to be ...
AbstractSmith's theorem states that in a cubic graph the number of Hamiltonian cycles containing a g...
AbstractA circuit code of dimension d and spread k is a simple circuit which is formed from the vert...
AbstractConsider the subset graph G(n,k) whose vertex set C(n,k) is the set of all n-tuples of ‘0's’...
Add to ORKG