Hamiltonian

Graph Coloring and Hamiltonian Path: Backtracking on Graphs

Color a graph with m colors (no adjacent same color) and find Hamiltonian paths using backtracking with neighbor constraint checking.