Using 2-colorings in the theory of uniquely Hamiltonian graphs

Abstract

We use the concept of 2-coloring in analyzing UH3 graphs and building exact specifications of functions to find new UH3 graphs by Hamiltonian cycle edge extractions