A Subexponential Algorithm for Trivalent Graph Isomorphism

Abstract : This report contains two results: First, a polynomial-time algorithm to test color preserving isomorphism of two vertex-colored graphs in which each color class is of size k or less; Second, we improve Hoffman's algorithm for determining the automorphism group of a trivalent cone graph to deterministic time 0(n(clogn)) and extend it to arbitrary trivalent graphs. (Author)