✦ LIBER ✦

Generation of Rosary permutations expressed in Hamiltonian circuits

✍ Scribed by Harada, Kazuaki

Book ID: 115513051
Publisher: Association for Computing Machinery
Year: 1971
Tongue: English
Weight: 433 KB
Volume: 14
Category: Article
ISSN: 0001-0782
DOI: 10.1145/362604.362608

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the generation of rosary permu

A note on the generation of rosary permutations

✍ Read, Ronald C. 📂 Article 📅 1972 🏛 Association for Computing Machinery 🌐 English ⚖ 94 KB

Hamiltonian circuits in interval graph g

Hamiltonian circuits in interval graph generalizations

✍ Alan A. Bertossi; Maurizio A. Bonuccelli 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 412 KB

Generation of permutations in lexicograp

Generation of permutations in lexicographical order

✍ Svein Mossige 📂 Article 📅 1970 🏛 Springer Netherlands 🌐 English ⚖ 96 KB

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

Generation of all Hamiltonian Circuits,

Generation of all Hamiltonian Circuits, Paths, and Centers of a Graph, and Related Problems

✍ Yau, S. 📂 Article 📅 1967 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 392 KB

On the Generation of Permutations in Mag

On the Generation of Permutations in Magnetic Bubble Memories

✍ Chen, C.L. 📂 Article 📅 1978 🏛 IEEE 🌐 English ⚖ 517 KB