The Complexity of Graph Isomorphism for Colored Graphs with Color Classes of Size 2 and 3

Johannes Köbler, Jacobo Torán. The Complexity of Graph Isomorphism for Colored Graphs with Color Classes of Size 2 and 3. In Helmut Alt, Afonso Ferreira, editors, STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings. Volume 2285 of Lecture Notes in Computer Science, pages 121-132, Springer, 2002. [doi]

Abstract

Abstract is missing.