相关论文: Region crossing change on spatial theta-curves

A region crossing change is a local transformation on spatial graph diagrams switching the over/under relations at all the crossings on the boundary of a region. In this paper, we show that a spatial graph of a planar graph is unknottable…

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.

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.

In this paper, we give a classification of link diagrams on nonorientable surfaces up to region crossing changes.

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…

We introduce a local move on a link diagram named a region freeze crossing change which is close to a region crossing change, but not the same. We study similarity and difference between region crossing change and region freeze crossing…

In this short note, we investigate the effect of region crossing change on planar trivalent graphs.

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…

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…

Networks embedded in space can display all sorts of transitions when their structure is modified. The nature of these transitions (and in some cases crossovers) can differ from the usual appearance of a giant component as observed for the…

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…

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…

In this paper, we discuss the crossing change operation along exchangeable double curves of a surface-knot diagram. We show that under certain condition, a finite sequence of Roseman moves preserves the property of those exchangeable double…

A corner in a map is an edge-vertex-edge triple consisting of two distinct edges incident to the same vertex. A corneration is a set of corners that covers every arc of the map exactly once. Cornerations in a dart-transitive map generalize…

We study relations between unknotting number and crossing number of a spatial embedding of a handcuff-graph and a theta curve. It is well known that for any non-trivial knot $K$ twice the unknotting number of $K$ is less than or equal to…

The operation of transforming one spanning tree into another by replacing an edge has been considered widely, both for general and planar straight-line graphs. For the latter, several variants have been studied (e.g., edge slides and edge…

The crossing number of a graph is the minimum number of double points over all generic immersions of the graph into the plane. In this paper we investigate the behavior of crossing number under a graph transformation, called $\mathsf{\Delta…

A graph is periodic if it can be obtained by joining identical pieces in a cyclic fashion. It is shown that the limit crossing number of a periodic graph is computable. This answers a question of Benny Pinontoan and Bruce Richter (2004).

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…

We prove that all $1$-vertex spatial graphs with adequate diagrams have minimal crossing number, and that spatial graph diagrams obtained by replacing vertices and edges of a planar embedded graph by minimal crossing link or spatial graph…