<p>A chain with several self-crossing points before and after untangling. Various topological substructures that are discussed in the text are color coded. For the case of the legs (red and cyan) note that various other legs can be identified, for example a leg that starts at crossing 2 and ends at the red terminus. Here we color only the shortest legs from crossing 1 to the terminus as red, and crossing 2 to the opposite terminus as cyan.</p
We study an algorithmic problem that is motivated by ink minimization for sparse set visualizations....
<div><p>Colors change continuously from red (first residue) to blue (last residue). A reduced repres...
We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph ...
<p>(a) A 3 link chain with its vertical projection. A crossing in the projection is shown with a gre...
• General principle (Brieskorn, Alexander): Colour the arcs of a braid or a link diagram extract in...
<p>Two possible untangling transformations. The top transformation involves twisting of the loop. Th...
<p>A few snapshots during a transformation involving 2 instances of chain crossing. The transformati...
<p>(A) An illustration that how these landmarks forming a sub-network. (B) A real example that two g...
<p>The first row represents the first level of the hierarchy of triangles, with triangles adjacent t...
We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph ...
Knots and links can be categorized by invariants such as colorability. A knot is a three-dimensional...
The use of crystal engineering concepts has produced a variety of coordination networks, many of whi...
<div><p>We introduce a method for calculating the extent to which chain non-crossing is important in...
Colored from N-terminus (blue) to C-terminus (red). (A) The PURPLE_3_monomer model shows its DivIVA-...
<p>If the sticky loop (dark green segment) is entangled with the knot (panels a and b), its removal ...
We study an algorithmic problem that is motivated by ink minimization for sparse set visualizations....
<div><p>Colors change continuously from red (first residue) to blue (last residue). A reduced repres...
We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph ...
<p>(a) A 3 link chain with its vertical projection. A crossing in the projection is shown with a gre...
• General principle (Brieskorn, Alexander): Colour the arcs of a braid or a link diagram extract in...
<p>Two possible untangling transformations. The top transformation involves twisting of the loop. Th...
<p>A few snapshots during a transformation involving 2 instances of chain crossing. The transformati...
<p>(A) An illustration that how these landmarks forming a sub-network. (B) A real example that two g...
<p>The first row represents the first level of the hierarchy of triangles, with triangles adjacent t...
We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph ...
Knots and links can be categorized by invariants such as colorability. A knot is a three-dimensional...
The use of crystal engineering concepts has produced a variety of coordination networks, many of whi...
<div><p>We introduce a method for calculating the extent to which chain non-crossing is important in...
Colored from N-terminus (blue) to C-terminus (red). (A) The PURPLE_3_monomer model shows its DivIVA-...
<p>If the sticky loop (dark green segment) is entangled with the knot (panels a and b), its removal ...
We study an algorithmic problem that is motivated by ink minimization for sparse set visualizations....
<div><p>Colors change continuously from red (first residue) to blue (last residue). A reduced repres...
We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph ...