On Graph Isomorphism Complete Problems I am interested to study Graph Isomorphism (GI) complete problems.

In the Paper " Problems Polynomially Equivalent to Graph Isomorphism" by Kellogg S. Booth, (1979), proved that many basic problems are GI complete by using Edge replacement techniques, Composition techniques etc. 

I would like to learn some more techniques which are used in recent papers.

Can some one suggest me some recent papers which are more concentrated in proving some graph class is GI complete.
Graph Isomorphism Completeness for Perfect Graphs
and Subclasses of Perfect Graphs
C. Boucher D. Loker (2006)



  In this paper, we prove that deciding
  isomorphism of double split graphs, the class of graphs exhibiting a 2-join, and the class of
  graphs exhibiting a balanced skew partition are GI-complete. Further, we show that the GI
  problem for the larger class including these graph classes–that is, the class of perfect graphs–is
  also GI-complete.