Nonrepetitive Paths and Cycles in Graphs with Application to Sudoku

@article{Eppstein2005NonrepetitivePA,
  title={Nonrepetitive Paths and Cycles in Graphs with Application to Sudoku},
  author={David Eppstein},
  journal={CoRR},
  year={2005},
  volume={abs/cs/0507053}
}
We provide a simple linear time transformation from a direct ed or undirected graph with labeled edges to an unlabeled digraph, such that paths in the input graph in which no two consecutive edges have the same label correspond to paths in the transformed graph and vice v ersa. Using this transformation, we provide efficient algorithms for finding paths and cycles with no two consecuti ve equal labels. We also consider related problems where the paths and cycles are required to be simple; we… CONTINUE READING