Bibliography

BK73

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

Br'e79

D. Br'elaz.
New Methods to Color the Vertices of a Graph.
Communications of the ACM, 22(9):251--256, 1979.

Chr75

N. Christofides.
Graph Theory, An Algorithm Approach.
Academic Press, 1975.

McK

B. D. McKay.
nauty User's Guide (Version 1.5).
http://www.maths.usyd.edu.au/u/magma/Papers/Incidence/nauty_manual.ps.

McK81

B. D. McKay.
Practical Graph Isomorphism.
Congressus Numerantium, 30:45--87, 1981.

McK98

B. D. McKay.
Isomorph-free exhaustive generation.
J. Algorithms, 26:306--324, 1998.

WM

N. Walker W. Myrvold, T. Prsa.
A Dynamic Programming Approach for Timing and Designing Clique Algorithms.
available at http://www.csc.uvic.ca/ wendym.