An algorithm for finding simultaneous homomorphic correspondences between graphs and their image graphs
- 1 January 1976
- journal article
- research article
- Published by Wiley in Behavioral Science
- Vol. 21 (1) , 26-35
- https://doi.org/10.1002/bs.3830210105
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Algorithm 457: finding all cliques of an undirected graphCommunications of the ACM, 1973
- Theory of GraphsPublished by American Mathematical Society (AMS) ,1962
- An Algorithm for Distinct RepresentativesThe American Mathematical Monthly, 1956