Length of longest sequence avoiding an unavoidable set for different values of <i>k</i>.

For each value k, a minimum decycling set was removed from a complete de Bruijn graph, and the length Lmax of the longest sequence, represented as a longest path, was calculated.