This is a preview. Log in through your library . Abstract A non-backtracking walk on a graph, H, is a directed path of directed edges of H such that no edge is the inverse of its preceding edge.

For anyone who has ever struggled while attempting to solve a Sudoku puzzle, mathematicians are coming to the rescue. They can not only explain why some Sudoku puzzles are harder than others, they ...