Using clausal graphs to determine the computational complexity of k-bounded positive one-in-three SAT. - Richard Denman; Stephen Foster (Discret. Appl. Math., 2009)