✦ LIBER ✦

A new method of generating Hamiltonian cycles on the n-cube

✍ Scribed by Mark Ramras

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 196 KB
Volume: 85
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90390-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounds on the number of Hamiltonian circ

Bounds on the number of Hamiltonian circuits in the n-cube

✍ Robert James Douglas 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 224 KB

New upper anti lower ~,ounds arc found for the number of HamilI(,nian circuits in the graph of Ihe r -cube. (2) -1 i,, ,,' We show that h(n)~ [n(n -I)/212 .... '~'"""',"' = U~(e,) (3)

On ‘maximal’ Hamiltonian cycles in the s

On ‘maximal’ Hamiltonian cycles in the square of a block

✍ Günter Schaar 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 241 KB

On the Approximation of Finding A(nother

On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs

✍ Cristina Bazgan; Miklos Santha; Zsolt Tuza 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 144 KB

It is a simple fact that cubic Hamiltonian graphs have at least two Hamiltonian cycles. Finding such a cycle is NP-hard in general, and no polynomial-time algorithm is known for the problem of finding a second Hamiltonian cycle when one such cycle is given as part of the input. We investigate the co

A note on the edges of the n-cube

✍ Sergiu Hart 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 671 KB

The following combinatorial problem, which arose in game theory, is solved here: To tind a selt of vertices of ;P given size (in t.k nxube) which has a maximal number sf interconnecting edges,

On the number of hamiltonian cycles in a

On the number of hamiltonian cycles in a maximal planar graph

✍ S. L. Hakimi; E. F. Schmeichel; C. Thomassen 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 243 KB 👁 2 views

## Abstract We consider the problem of the minimum number of Hamiltonian cycles that could be present in a Hamiltonian maximal planar graph on __p__ vertices. In particular, we construct a __p__‐vertex maximal planar graph containing exactly four Hamiltonian cycles for every __p__ ≥ 12. We also pro

On a problem of Yuzvinsky on separating

On a problem of Yuzvinsky on separating the n-cube

✍ D.J. Kleitman 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 474 KB

The following problem of Yuzvinsky is solved here: how many vertices of the n-cube must be removed from it in order that no connected component of the rest contains an antipodal pair of vertices? Some further results and problems are described as well.