Recognizing Composite Graphs is Equivalent to Testing Graph Isomorphism

From Tetherless World Wiki

\begin{bibtex} @article{DBLP:journals/siamcomp/FeigenbaumS86,

 author    = {Joan Feigenbaum and
              Alejandro A. Sch{\"a}ffer},
 title     = {Recognizing Composite Graphs is Equivalent to Testing Graph
              Isomorphism},
 journal   = {SIAM J. Comput.},
 volume    = {15},
 number    = {2},
 year      = {1986},
 pages     = {619-627},
 bibsource = {DBLP, http://dblp.uni-trier.de}

}

\end{bibtex}