✦ LIBER ✦

Faces of diameter two on the Hamiltonian cycle polytype

✍ Scribed by Gerard Sierksma; Ruud H. Teunter; Gert A. Tijssen

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 401 KB
Volume: 18
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(95)00035-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Hamiltonian cycle and the Hamilto

On the Hamiltonian cycle and the Hamiltonian chain in the Cartesian product of two graphs

✍ K. A. Zaretskii 📂 Article 📅 1968 🏛 Springer US 🌐 English ⚖ 629 KB

On the number of Hamiltonian cycles in t

On the number of Hamiltonian cycles in triangulations

✍ Jan Kratochvil; Dainis Zeps 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 185 KB 👁 2 views

It is proved that if a planar triangulation different from K3 and K4 contains a Hamiltonian cycle, then it contains at least four of them. Together with the result of Hakimi, Schmeichel, and Thomassen [21, this yields that, for n 2 12, the minimum number of Hamiltonian cycles in a Hamiltonian planar

On the number of Hamiltonian cycles in t

On the number of Hamiltonian cycles in tournaments

✍ Carsten Thomassen 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 949 KB

The main results assert that the minimum number of Hamiltonian bypasses in a strong tournament of order n and the minimum number of Hamiltonian cycles in a 2-connected tournament of order n increase exponentially with n. Furthermore, the number of Hamiltonian cycles in a tournament increases at leas

Generalized hamiltonian circuits in the

Generalized hamiltonian circuits in the cartesian product of two-directed cycles

✍ Douglas S. Jungreis 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 299 KB

We find necessary and sufficient conditions for the existence of a closed walk that traverses r vertices twice and the rest once in the Cayley digraph of 2, @ 2,. This is a generalization of the results known for r = 0 or 1. In 1978, Trotter and Erdos [3] gave a necessary and sufficient condition f

When the cartesian product of two direct

When the cartesian product of two directed cycles is hypo-Hamiltonian

✍ Laurence E. Penn; David Witte 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB

We show that the Cartesian product Z, x Z, of two directed cycles is hypo-Hamiltonian (Hamiltonian) if and only if there is a pair of relatively prime positive integers m and n with ma + nb = ab -1 (ma + nb = ab). The result for hypo-Hamiltonian is new; that for Hamiltonian is known. These are speci

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