Alternating Hamiltonian cycles in $2$-edge-colored multigraphs

Alejandro Contreras-Balbuena, Hortensia Galeana-Sánchez, Ilan A. Goldfeder

A path (cycle) in a $2$-edge-colored multigraph is alternating if no two consecutive edges have the same color. The problem of determining the existence of alternating Hamiltonian…