Representing conjunctions with cycles. (a) Three cycles representing the literals , , and z, and the conjunction edges (bold) for a conjunction . (b) For x = y = false and z = true we obtain the conjunction-cycle Δ of length 6. (c) Any other assignment (e.g., x = true) destroys the conjunction cycle.
Mahmoody et al. BMC Bioinformatics 2012 13(Suppl 19):S9 doi:10.1186/1471-2105-13-S19-S9