The Conjugacy Problem for Finite Graph Products
From MaRDI portal
Recommendations
- The Conjugacy Problem for Graph Products with Infinite Cyclic Edge Groups
- On the conjugacy of finitely generated subgroups of a free group.
- The Conjugacy Problem for Graph Products with Finite Cyclic Edge Groups
- The Word Problem and Related Results for Graph Product Groups
- Conjugacy word problem in the tree product of free groups with a cyclic amalgamation
Cites work
Cited in
(11)- On multiplicative graphs and the product conjecture
- The identity problem for graph products of groups
- Graph congruences and wreath products
- A CONJUGATION-FREE GEOMETRIC PRESENTATION OF FUNDAMENTAL GROUPS OF ARRANGEMENTS II: EXPANSION AND SOME PROPERTIES
- The Word Problem and Related Results for Graph Product Groups
- The Conjugacy Problem for Graph Products with Infinite Cyclic Edge Groups
- The Conjugacy Problem for Graph Products with Finite Cyclic Edge Groups
- Graph products and new solutions to Oberwolfach problems
- Semistability of graph products
- A proof of a conjecture of Sabidussi on graphs idempotent under the lexicographic product
- On the Hadwiger's conjecture for graph products
This page was built for publication: The Conjugacy Problem for Finite Graph Products
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4206934)