k-Level Menage-type Hamiltonian cycles derived from a given (k−1)-level cycle
Applied Mathematical Sciences · 2026 · 20 (4) · 185-193
DOI: 10.12988/ams.2026.919335 ↗Kurz gefasst
Fachartikel in der Zeitschrift Applied Mathematical Sciences, 2026. Verfasst von Morteza Esmaeili und 1 weiteren Autor:innen.
Abstract (Originalsprache)
The Menage problem can be viewed as finding particular Hamiltonian cycles representing a $2\times n$ array. As a generalization of this problem we introduce the $k$-level Menage problem which considers $k\times n$ arrays. Using the inclusion-exclusion principle, we give an efficient algorithm to derive solutions for the $k$-level Menage problem of order $n$ from a given solution for the $(k-1)$-level Menage problem of the same order.
Zitieren
APA
Esmaeili, M., & Gulliver, T. A. (2026). k-Level Menage-type Hamiltonian cycles derived from a given (k−1)-level cycle. Applied Mathematical Sciences, 20(4), 185-193. https://doi.org/10.12988/ams.2026.919335
Vancouver
Esmaeili M, Gulliver TA. k-Level Menage-type Hamiltonian cycles derived from a given (k−1)-level cycle. Applied Mathematical Sciences. 2026;20(4):185-193. doi:10.12988/ams.2026.919335
BibTeX
@article{Esmaeili2026,
author = {Esmaeili, Morteza and Gulliver, T. Aaron},
title = {k-Level Menage-type Hamiltonian cycles derived from a given (k−1)-level cycle},
journal = {Applied Mathematical Sciences},
year = {2026},
volume = {20},
number = {4},
pages = {185--193},
doi = {10.12988/ams.2026.919335}
}
EUVIMED