The polynomial algorithm for graphs' isomorphism testing
  A polynomial algorithm for graphs' isomorphism testing is constructed in assumption that there exists a corresponding polynomial algorithm for graphs with trivial automorphism group. 
Aleksandr Golubchik (Osnabrueck, Germany)