Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference10 articles.
1. On the finite completion of partial latin cubes;Cruse;J. Combinatorial Theory, Ser. A,1974
2. The word problem for abstract algebras;Evans;J. London Math. Soc.,1951
3. Embedding incomplete latin squares;Evans;Amer. Math. Monthly,1960
4. Some connection between residual finiteness, finite embeddability and the word problem;Evans;J. London Math. Soc.,1969
5. Finitely presented loops, lattices, etc., are hopfian;Evans;J. London Math. Soc.,1969
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献