Three-colourability and forbidden subgraphs, II: Polynomial algorithms

Bert Randerath, Ingo Schiermeyer, and Meike Tewes
Discrete Mathematics 251(1–3):137–153, May 2002

Cites:

3-coloring in time $O(1.3446^n)$: a no-MIS algorithm

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine