[图书][B] Encyclopedia of knot theory

C Adams, E Flapan, A Henrich, LH Kauffman… - 2021 - api.taylorfrancis.com
" Knot theory is a fascinating mathematical subject, with multiple links to theoretical physics.
This enyclopedia is filled with valuable information on a rich and fascinating subject."–Ed …

(1, 2) and weak (1, 3) homotopies on knot projections

N Ito, Y Takimura - Journal of Knot Theory and Its Ramifications, 2013 - World Scientific
In this paper, we obtain the necessary and sufficient condition that two knot projections are
related by a finite sequence of the first and second flat Reidemeister moves (Theorem 2.2) …

Complementary regions of knot and link diagrams

C Adams, R Shinjo, K Tanaka - Annals of Combinatorics, 2011 - Springer
An increasing sequence of integers is said to be universal for knots and links if every knot
and link has a reduced projection on the sphere such that the number of edges of each …

Determining the component number of links corresponding to lattices

X Jin, F Dong, EG Tay - Journal of Knot Theory and its Ramifications, 2009 - World Scientific
It is well known that there is a one-to-one correspondence between signed plane graphs
and link diagrams via the medial construction. The component number of the corresponding …

[PDF][PDF] The link component number of suspended trees

T Endo - arXiv preprint arXiv:0905.2478, 2009 - arxiv.org
arXiv:0905.2478v1 [math.CO] 15 May 2009 Page 1 arXiv:0905.2478v1 [math.CO] 15 May 2009
The Link Component Number of Suspended Trees Toshiki Endo Jiyu Gakuen College, 1-8-15 …

Triple chords and strong (1, 2) homotopy

N Ito, Y Takimura - Journal of the Mathematical Society of Japan, 2016 - jstage.jst.go.jp
A triple chord fis a sub-diagram of a chord diagram that consists of a circle and finitely many
chords connecting the preimages for every double point on a spherical curve. This paper …

[PDF][PDF] Drawing Knots with Tutte Embedding

C Browne - Bridges Proceedings - ludeme.eu
When drawing planar representations of mathematical knots, it is challenging to find 2D
embeddings that minimise the amount of smoothing required to produce aesthetically …

[HTML][HTML] The delunification process and minimal diagrams

S Jablan, LH Kauffman, P Lopes - Topology and its Applications, 2015 - Elsevier
A link diagram is said to be lune-free if, when viewed as a 4-regular plane graph it does not
have multiple edges between any pair of nodes. We prove that any colored link diagram is …

Bisected vertex leveling of plane graphs: Braid index, arc index and delta diagrams

S No, S Oh, H Yoo - Journal of Knot Theory and Its Ramifications, 2018 - World Scientific
In this paper, we introduce a bisected vertex leveling of a plane graph. Using this planar
embedding, we present elementary proofs of the well-known upper bounds in terms of the …

[引用][C] 几种曲面上的方格和三角格的左右路的计数(英文)

蒋乐萍, 金贤安 - 数学研究, 2011