The Conjugacy Problem for Graph Products with Cyclic Edge Groups

DOI10.2307/2043615zbMath0477.20021OpenAlexW4241012461MaRDI QIDQ3934698

Kathy Horadam

Publication date: 1983

Full work available at URL: https://doi.org/10.2307/2043615

zbMATH Keywords

free products with amalgamationconjugacy problemgraph productfundamental group of a graph of groupsHNN groups

Mathematics Subject Classification ID

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)

Related Items (2)

The Conjugacy Problem for Graph Products with Central Cyclic Edge Groups ⋮ The conjugacy problem for Higman’s group

Cites Work

• The conjugacy problem for free products of sixth-groups with cyclic amalgamation
• The Word Problem and Related Results for Graph Product Groups
• The solvability of the conjugacy problem for certain HNN groups
• The conjugacy problem and cyclic amalgamations
• On Cyclic Subgroups and the Conjugacy Problem
• On Group-Theoretic Decision Problems and Their Classification. (AM-68)
• Graphen ohne unendliche Wege
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Conjugacy Problem for Graph Products with Cyclic Edge Groups