Generation of Rosary permutations expressed in Hamiltonian circuits

DOI10.1145/362604.362608zbMath0223.94019OpenAlexW2085436632MaRDI QIDQ5629535

Kazuaki Harada

Publication date: 1971

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/362604.362608

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Combinatorial Algorithms for Listing Paths in Minimal Change Order

This page was built for publication: Generation of Rosary permutations expressed in Hamiltonian circuits