Bibliography

[Bre79]

D. Brelaz. New methods to color the vertices of a graph. Communications of the ACM, 22(9):251–256, 1979.

[BK73]

C. Bron and J. Kerbosch. Finding All Cliques of an Undirected Graph. Communications of the ACM 9, 16(9):575–577, 1973.

[MPW]

W. Myrvold, T. Prsa, and N. Walker. A dynamic programming approach for timing and designing clique algorithms. available at \biburl http://www.csr.uvic.ca/˜wendym/.