Breaking the $2^n$ barrier for graph $k$-coloring | Digital Library | PAMCET | PAMCET