Related papers: Unknottability of spatial graphs by region crossin…
A region crossing change at a region of a spatial-graph diagram is a transformation changing every crossing on the boundary of the region. In this paper, it is shown that every spatial graph consisting of theta-curves can be unknotted by…
Region crossing change is a local transformation on a knot or link diagram. We show that a region crossing change on a knot diagram is an unknotting operation, and we define the region unknotting numbers for a knot diagram and a knot.
In this paper, we prove that region crossing change on a link diagram is an unknotting operation if and only if the link is proper. A description of the behavior of region crossing change on link diagrams is given. Furthermore we also…
In this paper, we give a classification of link diagrams on nonorientable surfaces up to region crossing changes.
Region crossing change is a local operation on link diagrams. The behavior of region crossing change on $S^2$ is well understood. In this paper, we study the behavior of (modified) region crossing change on higher genus surfaces.
Determining unknotting numbers is a large and widely studied problem. We consider the more general question of the unknotting number of a spatial graph. We show the unknotting number of spatial graphs is subadditive. Let $g$ be an embedding…
In a recent work of Ayaka Shimizu$^{[5]}$, she defined an operation named region crossing change on link diagrams, and showed that region crossing change is an unknotting operation for knot diagrams. In this paper, we prove that region…
In this short note, we investigate the effect of region crossing change on planar trivalent graphs.
It is known that the unknotting number $u(L)$ of a link $L$ is less than or equal to half the crossing number $c(L)$ of $L$. We show that there are a planar graph $G$ and its spatial embedding $f$ such that the unknotting number $u(f)$ of…
This paper extends the study of arc crossing change, a local operation on knot diagrams recently introduced by Cericola, from knot diagrams to link diagrams. We consider two types of arc crossing change on link diagrams and discuss when…
A plane graph is called a rectangular graph if each of its edges can be oriented either horizontally or vertically, each of its interior regions is a four-sided region and all interior regions can be fitted in a rectangular enclosure. If…
A graph G is called "minimalizable" if a diagram with minimal crossing number can be obtained from an arbitrary diagram of G by crossing changes. If, furthermore, the minimal diagram is unique up to crossing changes then G is called…
A plane graph is called a rectangular graph if each of its edges can be oriented either horizontally or vertically, each of its interior regions is a four-sided region and all interior regions can be fitted in a rectangular enclosure. Only…
In a drawing of a clustered graph vertices and edges are drawn as points and curves, respectively, while clusters are represented by simple closed regions. A drawing of a clustered graph is c-planar if it has no edge-edge, edge-region, or…
We study tangle replacement in the context of spatial graphs. The main results show that, for certain spatial handcuff graphs, there is a one-to-one correspondence between the neighborhood equivalence classes of the spatial graphs obtained…
A geographic network is a graph whose vertices are restricted to lie in a prescribed region in the plane. In this paper we begin to study the following fundamental problem for geographic networks: can a given geographic network be drawn…
When can a unimodular random planar graph be drawn in the Euclidean or the hyperbolic plane in a way that the distribution of the random drawing is isometry-invariant? This question was answered for one-ended unimodular graphs in…
A knot is an an embedding of a circle into three-dimensional space. We say that a knot is unknotted if there is an ambient isotopy of the embedding to a standard circle. By representing knots via planar diagrams, we discuss the problem of…
We show that the strongly regular graph on non-isotropic points of one type of the polar spaces of type $U(n, 2)$, $O(n, 3)$, $O(n, 5)$, $O^+(n, 3)$, and $O^-(n, 3)$ are not determined by its parameters for $n \geq 6$. We prove this by…
We study straight-line drawings of planar graphs with prescribed face areas. A plane graph is 'area-universal' if for every area assignment on the inner faces, there exists a straight-line drawing realizing the prescribed areas. For…