Enumerating Hamiltonian Paths and Cycles
arXiv:2610.06644
Abstract
We prove counting formulae for the number of directed Hamiltonian paths and directed Hamiltonian cycles in any complete multipartite graph. The method is based on a collapsing technique relating general path graphs with coloured vertices to legally coloured path graphs.