The Conjugacy Problem for Graph Products with Central Cyclic Edge Groups
DOI10.2307/2045299zbMATH Open0512.20018OpenAlexW4238834617MaRDI QIDQ4750852FDOQ4750852
Authors: Kathy Horadam
Publication date: 1984
Full work available at URL: https://doi.org/10.2307/2045299
conjugacy problemHNN extensionsfree products with amalgamationfundamental group of graph of groupsgraph products with cyclic edge groups
Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Cites Work
- Title not available (Why is that?)
- On Group-Theoretic Decision Problems and Their Classification. (AM-68)
- The solvability of the conjugacy problem for certain HNN groups
- The conjugacy problem and cyclic amalgamations
- Title not available (Why is that?)
- On Cyclic Subgroups and the Conjugacy Problem
- Conjugate Powers in HNN Groups
- The Word Problem and Related Results for Graph Product Groups
- The Conjugacy Problem for Graph Products with Cyclic Edge Groups
Cited In (4)
This page was built for publication: The Conjugacy Problem for Graph Products with Central Cyclic Edge Groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4750852)