The Conjugacy Problem for the Group of Any Tame Alternating Knot is Solvable (Q5654237): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
label / enlabel / en
 
The Conjugacy Problem for the Group of Any Tame Alternating Knot is Solvable
Property / author
 
Property / author: Kenneth I. Appel / rank
Normal rank
 
Property / author
 
Property / author: Kenneth I. Appel / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.2307/2038056 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4255909707 / rank
 
Normal rank
Property / title
 
The Conjugacy Problem for the Group of Any Tame Alternating Knot is Solvable (English)
Property / title: The Conjugacy Problem for the Group of Any Tame Alternating Knot is Solvable (English) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Dehn's algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5788031 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Dehn's algorithm and the conjugacy problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Word and Conjugacy Problems for the Knot Group of any Tame, Prime, Alternating Knot / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:34, 12 June 2024

scientific article; zbMATH DE number 3384299
Language Label Description Also known as
English
The Conjugacy Problem for the Group of Any Tame Alternating Knot is Solvable
scientific article; zbMATH DE number 3384299

    Statements

    0 references
    0 references
    1972
    0 references
    The Conjugacy Problem for the Group of Any Tame Alternating Knot is Solvable (English)
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references