Tomás Feder Rajeev Motwani Worst-case time bounds for coloring and satisfiability problems. 192-201 2002 45 J. Algorithms 2 http://dx.doi.org/10.1016/S0196-6774(02)00224-9 db/journals/jal/jal45.html#FederM02