Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs

@article{Colbourn1981LinearTA,
  title={Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs},
  author={Charles J. Colbourn and Kellogg S. Booth},
  journal={SIAM J. Comput.},
  year={1981},
  volume={10},
  pages={203-225}
}

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
44 Extracted Citations
2 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-2 of 2 references

A linear time algorithm for isomorphisms of maximal outerplanar graphs

  • J. E. Hopcroft
  • J . Assoc . Comput . Mach .
  • 1974

Similar Papers

Loading similar papers…