Standard

Spatial graphs, tangles and plane trees. / Nezhinskij, V.N.

в: St. Petersburg Mathematical Journal, Том 31, № 6, 2020, стр. 1055-1063.

Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование

Harvard

Nezhinskij, VN 2020, 'Spatial graphs, tangles and plane trees', St. Petersburg Mathematical Journal, Том. 31, № 6, стр. 1055-1063.

APA

Nezhinskij, V. N. (2020). Spatial graphs, tangles and plane trees. St. Petersburg Mathematical Journal, 31(6), 1055-1063.

Vancouver

Nezhinskij VN. Spatial graphs, tangles and plane trees. St. Petersburg Mathematical Journal. 2020;31(6):1055-1063.

Author

Nezhinskij, V.N. / Spatial graphs, tangles and plane trees. в: St. Petersburg Mathematical Journal. 2020 ; Том 31, № 6. стр. 1055-1063.

BibTeX

@article{96d958946ae447439577601e4605f452,
title = "Spatial graphs, tangles and plane trees",
abstract = "All (finite connected) spatial graphs are supplied with an additional structure - the replenished skeleton and its disk framing, - in such a way that the problem of isotopic classification of spatial graphs endowed with this structure admits reduction to two problems: the (classical) problem of isotopic classification of tangles and the (close to classical) problem of isotopic classification of plane trees equipped with an additional structure, specifically, a set of hanging vertices and a fixed vertex (the root of the tree) in this set.",
keywords = "Chord diagrams, TANGLE, PLANE TREE, SPACIAL GRAPH, SPACIAL TORTOISE, SMOOTH ISOTOPY",
author = "V.N. Nezhinskij",
year = "2020",
language = "English",
volume = "31",
pages = "1055--1063",
journal = "St. Petersburg Mathematical Journal",
issn = "1061-0022",
publisher = "American Mathematical Society",
number = "6",

}

RIS

TY - JOUR

T1 - Spatial graphs, tangles and plane trees

AU - Nezhinskij, V.N.

PY - 2020

Y1 - 2020

N2 - All (finite connected) spatial graphs are supplied with an additional structure - the replenished skeleton and its disk framing, - in such a way that the problem of isotopic classification of spatial graphs endowed with this structure admits reduction to two problems: the (classical) problem of isotopic classification of tangles and the (close to classical) problem of isotopic classification of plane trees equipped with an additional structure, specifically, a set of hanging vertices and a fixed vertex (the root of the tree) in this set.

AB - All (finite connected) spatial graphs are supplied with an additional structure - the replenished skeleton and its disk framing, - in such a way that the problem of isotopic classification of spatial graphs endowed with this structure admits reduction to two problems: the (classical) problem of isotopic classification of tangles and the (close to classical) problem of isotopic classification of plane trees equipped with an additional structure, specifically, a set of hanging vertices and a fixed vertex (the root of the tree) in this set.

KW - Chord diagrams

KW - TANGLE

KW - PLANE TREE

KW - SPACIAL GRAPH

KW - SPACIAL TORTOISE

KW - SMOOTH ISOTOPY

UR - https://www.elibrary.ru/item.asp?id=44256666

M3 - Article

VL - 31

SP - 1055

EP - 1063

JO - St. Petersburg Mathematical Journal

JF - St. Petersburg Mathematical Journal

SN - 1061-0022

IS - 6

ER -

ID: 71385230