AbstractA heuristic methodology for the identification of a circuit passing through all the vertices only once in a graph is presented. The procedure is based upon defining a normal form of a matrix and then transforming the adjacency matrix into its normal form. For a class of graphs known to be Hamiltonian, it is conjectured that this methodology will identify circuits in a small number of steps and in many cases merely by observation.