References 1

• R. Diestel, Graph Theory, 3rd ed. Springer, 2005.
  (Diestel's "Graph Theory" book page. The book itself is freely downloadable.)
• D.B. West, Introduction to Graph Theory, 2nd ed. Prentice Hall, 2001.
  (West's "Introduction to Graph Theory" book page)
• J.A. Bondy and U.S.R. Murty, Graph Theory. Springer, 2008.
  (Blog of the book)
• L. Babai and E.M. Luks, Canonical labeling of graphs. Proc. 15th STOC (1983) 171-183.
  (ACM DL)
• nauty: a program for graph automorphisms (B.D. McKay)
• A. Itai and M. Rodeh, Finding a minimum circuit in a graph. SIAM J. Comput. 7 (1978) 413-423.
  (ACM DL (9th STOC version))
• C.D. Godsil, So few Moore graphs. Manuscript.
  This contains an argument of Higman for the non-vertex-transitivity of a 57-regular graph with girth five and diameter two.
  (Manuscript)
• G. Chen and A. Saito, Graphs with a cycle of length divisible by three. J. Combin. Theory Ser. B 60 (1994) 277-292.
  (Elsevier ScienceDirect)
• N. Dean, L. Lesniak, and A. Saito, Cycles of length 0 modulo 4 in graphs. Discrete Math. 121 (1993) 37-49.
  (Elsevier ScienceDirect)
• D. Daniel and S. Shauger, A result on the Erdős-Gyárfás conjecture in planar graphs. Congr. Numer. 153 (2001) 129-139.
• K. Markström, Extremal graphs for some problems on cycles in graphs. Congr. Numer. 171 (2004) 179-192.