The Conjugacy Problem for Graph Products with Finite Cyclic Edge Groups
DOI10.2307/2159513zbMATH Open0799.20029OpenAlexW4242549967MaRDI QIDQ4039286FDOQ4039286
Authors: Jody Meyer Lockhart
Publication date: 8 August 1993
Full work available at URL: https://doi.org/10.2307/2159513
Recommendations
- The Conjugacy Problem for Graph Products with Infinite Cyclic Edge Groups
- The Conjugacy Problem for Finite Graph Products
- The Word Problem and Related Results for Graph Product Groups
- The identity problem for graph products of groups
- On conjugacy separability of graph products of groups.
- The conjugacy problem for subgroups in a free product of infinite cyclic groups
- Cycles and bipartite graphs on conjugacy class of groups
- Some problems about products of conjugacy classes in finite groups
- On graphs related to conjugacy classes of groups
- On the conjugacy separability of certain graphs of groups
Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Cites Work
Cited In (5)
- The Word Problem and Related Results for Graph Product Groups
- Congruences of Edge-bipartite Graphs with Applications to Grothendieck Group Recognition I. Inflation Algorithm Revisited*
- The identity problem for graph products of groups
- The Conjugacy Problem for HNN Extensions with Infinite Cyclic Associated Groups
- The Conjugacy Problem for Finite Graph Products
This page was built for publication: The Conjugacy Problem for Graph Products with Finite Cyclic Edge Groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4039286)