25 citations · 57 across the 22 of their papers we have counts for
3 papers · 1 filter
Describing realizable Gauss diagrams using the concepts of parity or bipartate graphs
Alexei Lisitsa, Viktor Lopatkin, Alexei Vernitski
Two recent publications describe realizable Gauss diagrams using conditions stating that the number of chords in certain sets of chords is even or odd. We demonstrate that these de…
Circle graphs (chord interlacement graphs) of Gauss diagrams: Descriptions of realizable Gauss diagrams, algorithms, enumeration
Abdullah Khan, Alexei Lisitsa, Viktor Lopatkin +1
Chord diagrams, under the name of Gauss diagrams, are used in low-dimensional topology as an important tool for studying curves or knots. Those Gauss diagrams that correspond to cu…
On Realizability of Gauss Diagrams
Andrey Grinblat, Viktor Lopatkin
The problem of which Gauss diagram can be realized by knots is an old one and has been solved in several ways. In this paper, we present a direct approach to this problem. We show…