Isomorphism testing and canonical forms for k-contractable graphs (A generalization of bounded valence and bounded genus)

  • Gary L. Miller
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 158)


This paper includes polynomial time isomorphism tests and canonical forms for graphs called k-contractable graphs for fixed k. The class of k-contractable graphs includes the graphs of bounded valence and the graphs of bounded genus. The algorithm uses several new ideas including: (1) it removes portions of the graph and replaces them with groups which are used to keep track of the symmetries of these portions; (2) it maintains with each group a tower of equivalence relation which allows a decomposition of the group. These towers are called a tower of Γk actions. It considers the canonical intersection of groups.


Canonical Form Permutation Group Wreath Product Multiple Edge Recursive Call 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Ba 81]
    L. Babai, "Moderately Exponential Bound for Graph Isomorphism", Proc. Conf. on Foundation of Computation Theory, Szeget (1981).Google Scholar
  2. [BCP ta]
    L. Babai, P.J. Cameron, P.P. Palfy, "On the Order of Primitive Permutation Groups with Bounded Nonabelian Composition Factors", in preparation.Google Scholar
  3. [BL 83]
    L. Babai, E. Luks, "Canonical Labeling of Graphs", STOC 83.Google Scholar
  4. [Ca 81]
    P.J. Cameron, "Finite Permutation Groups and Finite Simple Groups", Bull. London Math. Soc. 13, 1981, pp. 1–22.Google Scholar
  5. [FM 80]
    I.S. Filotti, J.N. Mayer, "A Polynomial-time Algorithm for Determining the Isomorphism of Graphs of Fixed Genus", Proc. 12th ACM Symp. Th. Comp. (1980), pp. 236–243.Google Scholar
  6. [FMR 79]
    I.S. Filotti, G.L. Miller and J. Reif, "On Determining the Genus of a Graph in 0(V0(g)) Steps".Google Scholar
  7. [FSS 83]
    Furer, Schnyder, Specker, "Normal Forms for Frivalent Graphs", STOC 83.Google Scholar
  8. [HT 73]
    J.E. Hopcroft, R.E. Tarjan, "Dividing a Graph into Triconnected Components", SIAM J. Comput., Vol. 2, No. 3, Sept. 1973, pp. 294–303.Google Scholar
  9. [Li 80]
    D. Lichtenstein, "Isomorphism for Graphs Embeddable on the Projective Plane", Proc. 12th ACM Symp. Th. Symp. (1980), pp. 218–224.Google Scholar
  10. [Lu 80]
    E.M. Luks, "Isomorphism of Bounded Valence can be Tested in Polynomial Time", in Proc. 21st Annual Symposium of Foundations of Computer Science, IEEE (1980).Google Scholar
  11. [Ml 79]
    G.L. Miller, "Graph Isomorphism, General Remarks", JCSS, Vol. 18, No. 2, April 1979, pp. 128–141.Google Scholar
  12. [Ml 80]
    G.L. Miller, "Isomorphism Testing for Graphs of Bounded Genus" (working paper), Proc. 12th ACM Symp. Th. Comp. (1980), pp. 225–235.Google Scholar
  13. [Ml tal]
    G.L. Miller, "Isomorphism of Graphs which are Pairwise k-Separable", submitted to Information and Control.Google Scholar
  14. [Ml ta2]
    G.L. Miller, "Isomorphism of k-Contractable Graphs (a generalization of bounded valence and bounded genus)", submitted to Information and Control.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • Gary L. Miller
    • 1
  1. 1.Department of MathematicsMassachusetts Institute of TechnologyCambridge

Personalised recommendations