✦ LIBER ✦

The number of Hamiltonian paths in a rectangular grid

✍ Scribed by Karen L. Collins; Lucia B. Krompart

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 467 KB
Volume: 169
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00330-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient Algorithms for Finding the Max

Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids

✍ Wun-Tat Chan; Francis Y.L. Chin 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 366 KB

In a rectangular grid, given two sets of nodes, S S sources and T T sinks , of size 2 Ž . each, the disjoint paths DP problem is to connect as many nodes in S S to the Ž nodes in T T using a set of ''disjoint'' paths. Both edge-disjoint and ¨ertex-disjoint . cases are considered in this paper. Note

A Parallel Reduction of Hamiltonian Cycl

A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments

✍ E. Bampis; M. Elhaddad; Y. Manoussakis; M. Santha 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 393 KB

Finding all the hamiltonian paths of a g

Finding all the hamiltonian paths of a graph and investigation of hamiltonian-connected graphs

✍ V.P. Kozyrev 📂 Article 📅 1976 🏛 Elsevier Science ⚖ 700 KB

On the hamiltonian path graph of a graph

✍ George R. T. Hendry 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 491 KB 👁 1 views

The hamiltonian path graph H(F) of a graph F is that graph having the same vertex set as F and in which two vertices u and u are adjacent if and only if F contains a hamiltonian u -u path. First, in response to a conjecture of Chartrand, Kapoor and Nordhaus, a characterization of nonhamiltonian grap

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 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