An effective algorithm for the enumeration of edge colorings and Hamiltonian cycles in cubic graphs

V. Ejov, N. Pugacheva, S. Rossomakhine +1

We propose an effective algorithm that enumerates (and actually finds) all 3-edge colorings and Hamiltonian cycles in a cubic graph. The idea is to make a preliminary run that sepa…