Detection of Hamiltonian circuits in a directed graph
Sudhangshu B. Karmakar · ANZIAM Journal · 1982
Abstract A simple algebraic method is presented to determine the necessary condition for the existence of a Hamiltonian circuit in a directed graph of n vertices. A search procedure is then introduced to identify any or all of the existing Hamiltonian circuits. The procedure is based upon finding a set of edges which will then be candidates for being parts of circuits of length n at any vertex of the graph.