Bibliography

BK73

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

BM01

J. Boyer and W. Myrvold.
Simplified O(n) Planarity Algorithms.
submitted, 2001.

Bre79

D. Brelaz.
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.

Eve79

Shimon Even.
Graph Algorithms.
Computer Science Press, 1979.

GM01

C. Gutwenger and P. Mutzel.
A Linear Time Implementation of SPQR-Trees.
In J. Marks, editor, Graph Drawing 2000, volume 1984 of Lecture Notes in Computer Science, pages 70--90. Springer-Verlag, 2001.

HT73

J.E. Hopcroft and R.E. Tarjan.
Dividing a Graph into Triconnected Components.
SIAM J. Comput., 2(3):135--158, 1973.

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.

RAO93

T.L. Magnanti R.K. Ahuja and J.B. Orlin.
Network Flows, Theory, Algorithms, and Applications.
Prentice Hall, 1993.

TCR90

C.E. Leiserson T.H. Cormen and R.L. Rivest.
Introduction to Algorithms.
MIT Press, 1990.

WM

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