Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Eugene M. Luks. Isomorphism of Graphs of Bounded Valence Can Be Tested in Polynomial Time. In 21st Annual Symposium on Foundations of Computer Science, 13-15 October 1980, Syracuse, New York, USA. pages 42-49, IEEE, 1980.
Abstract is missing.