squareroot.bbl
\begin{thebibliography}{KST93}

\bibitem[Boo78]{Booth:1978}
Kellogg~S. Booth.
\newblock Isomorphism testing for graphs, semigroups, and finite automata are
  polynomially equivalent problems.
\newblock {\em {SIAM} Journal on Computing}, 7(3):273--279, 1978.

\bibitem[Fle74]{Fleischner:1974}
Herbert Fleischner.
\newblock The square of every two-connected graph is {H}amiltonian.
\newblock {\em Journal of Combinatorial Theory (Series B)}, 16:29--34, 1974.

\bibitem[Kim82]{Kim:1982}
Ki~Hang Kim.
\newblock {\em Boolean matrix theory and applications}.
\newblock Marcel Decker, Inc., 1982.

\bibitem[KS01]{KaibelSchwartz:2001}
Volker Kaibel and Alexander Schwartz.
\newblock On the complexity of isomorphism problems related to polytopes.
\newblock To appear; preprint at arXiv: math.CO/01060093, 2001.

\bibitem[KST93]{KoeblerSchoeningToran:1993}
Johannes K\"obler, Uwe Sch\"oning, and Jacobo Tor\'an.
\newblock {\em The graph isomorphism problem}.
\newblock Birkh\"auser, 1993.

\bibitem[Mat79]{Mathon:1979}
Rudolph Mathon.
\newblock A note on the graph isomorphism counting problem.
\newblock {\em Information Processing Letters}, 8(3):131--132, 1979.

\bibitem[MS94]{MotwaniSudan:1994}
Rajeev Motwani and Madhu Sudan.
\newblock Computing roots of graphs is hard.
\newblock {\em Discrete Applied Mathematics}, 54(1):81--88, 1994.

\bibitem[RW88]{RossWright:1988:chp7.5}
Kenneth~A. Ross and Charles R.~B. Wright.
\newblock {\em Discrete mathematics}, chapter 7.5.
\newblock Prentice-Hall, second edition, 1988.

\end{thebibliography}
