Isomorphism of graphs of bounded valence can be tested in polynomial time
- 1 August 1982
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 25 (1) , 42-65
- https://doi.org/10.1016/0022-0000(82)90009-5
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Finite Permutation Groups and Finite Simple GroupsBulletin of the London Mathematical Society, 1981
- Moderately exponential bound for graph isomorphismLecture Notes in Computer Science, 1981
- Graph isomorphism, general remarksJournal of Computer and System Sciences, 1979
- Some group-theoretic algorithmsLecture Notes in Mathematics, 1978
- An Algorithm for Finding the Blocks of a Permutation GroupMathematics of Computation, 1975
- An algorithm for finding the blocks of a permutation groupMathematics of Computation, 1975
- ENDLICHE GRUPPEN IJournal of the London Mathematical Society, 1969
- Graphs and finite permutation groupsMathematische Zeitschrift, 1967
- The sylow 2-subgroups of the finite classical groupsJournal of Algebra, 1964
- Sylow p-Subgroups of the Classical Groups Over Finite Fields with Characteristic Prime to pProceedings of the American Mathematical Society, 1955