Hamiltonian Circuits: A Hierarchy of Examples

1977 ◽  
Vol 50 (1) ◽  
pp. 35
Author(s):  
James F. Smith ◽  
Michael J. Quinn
Keyword(s):  
Hamiltonian Circuits

scholarly journals On Hamiltonian circuits in Cayley diagrams

1982 ◽  
Vol 38 (1) ◽  
pp. 99-108 ◽  
Author(s):  
David S. Witte
Keyword(s):  
Hamiltonian Circuits

On the Existence of Hamiltonian Circuits in Faulty Hypercubes

1991 ◽  
Vol 4 (4) ◽  
pp. 511-527 ◽  
Author(s):  
Mee Yee Chan ◽  
Shiang-Jen Lee
Keyword(s):  
Hamiltonian Circuits

scholarly journals Tough graphs and hamiltonian circuits

2006 ◽  
Vol 306 (10-11) ◽  
pp. 910-917 ◽  
Author(s):  
V. Chvátal
Keyword(s):  
Hamiltonian Circuits

Hamiltonian Circuits on the N-Cube

1975 ◽  
Vol 17 (5) ◽  
pp. 759-761 ◽  
Author(s):  
D. H. Smith
Keyword(s):  
Upper Bound ◽  
Hamiltonian Circuits ◽  
Image Position

The problem of finding bounds for the number h(n) of Hamiltonian circuits on the n-cube has been studied by several authors, (1), (2), (3). The best upper bound known is due to Larman (5) who proved that .In this paper we use a result of Nijenhuis and Wilf (4) on permanents of (0, 1)- matrices to show that for n≥5where τ, a and c are constants.

Hamiltonian Circuits and Paths on the n-Cube

1966 ◽  
Vol 9 (05) ◽  
pp. 557-562 ◽  
Author(s):  
H. L. Abbott
Keyword(s):  
Unit Cube ◽  
Dimensional Unit ◽  
Hamiltonian Circuits

For positive integral n let Cn denote the n-dimensional unit cube with vertices (δ1, δ2,…, δn) where δi = 0 or 1 for i=1, 2,…, n. Call two vertices of Cn adjacent if the distance between them is 1.

Enumeration of Hamiltonian circuits in digraphs

1985 ◽  
Vol 73 (10) ◽  
pp. 1524-1525 ◽  
Author(s):  
V.V.B. Rao ◽  
K.S. Rao
Keyword(s):  
Hamiltonian Circuits
Sign in / Sign up

Export Citation Format

Share Document