Required-edge Cycle Cover Problem: an ASP-Completeness Framework for Graph Problems and Puzzles

Kosuke Susukita, Junichi Teruyama

Proving the NP-completeness of pencil-and-paper puzzles typically relies on reductions from combinatorial problems such as the satisfiability problem (SAT). Although the properties…