Lawler ( Chromatic Number)

Time Complexity

$O(mn({1}+{3}^({1}/{3})$)^n)

Space Complexity

$O({2}^n*log(n)$) words

(https://www.sciencedirect.com/science/article/pii/S0167637704000409)

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1976

Reference

https://www.sciencedirect.com/science/article/pii/002001907690065X?via%3Dihub