✦ LIBER ✦

A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments

✍ Scribed by E. Bampis; M. Elhaddad; Y. Manoussakis; M. Santha

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 393 KB
Volume: 19
Category: Article
ISSN: 0196-6774
DOI: 10.1006/jagm.1995.1045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding an Oriented Hamiltonian Path in

Finding an Oriented Hamiltonian Path in a Tournament

✍ Frédéric Havet 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 153 KB

We present an O n algorithm for finding a specified oriented path of order at Ž 2 . least n in a tournament of order n. Using this algorithm, we present an O n algorithm that finds a specified oriented path from a given vertex if one exists.

Oriented Hamiltonian Paths in Tournament

Oriented Hamiltonian Paths in Tournaments: A Proof of Rosenfeld's Conjecture

✍ Frédéric Havet; Stéphan Thomassé 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 284 KB

We prove that with three exceptions, every tournament of order n contains each oriented path of order n. The exceptions are the antidirected paths in the 3-cycle, in the regular tournament on 5 vertices, and in the Paley tournament on 7 vertices. ## 2000 Academic Press Tournaments are very rich st

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

Hamiltonian cycles and paths with a pres

Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets

✍ Rostislav Caha; V. Koubek 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 275 KB 👁 1 views

## Abstract This paper studies techniques of finding hamiltonian paths and cycles in hypercubes and dense sets of hypercubes. This problem is, in general, easily solvable but here the problem was modified by the requirement that a set of edges has to be used in such path or cycle. The main result o

The Complexity of Finding a Second Hamil

The Complexity of Finding a Second Hamiltonian Cycle in Cubic Graphs

✍ Adam Krawczyk 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 120 KB

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