Describing realizable Gauss diagrams using the concepts of parity or bipartite graphs

DOI10.1142/s0218216523500591arXiv2212.07140OpenAlexW4385341052MaRDI QIDQ6064923

Alexej P. Lisitsa, Alexei Vernitski, Viktor Lopatkin

Publication date: 11 December 2023

Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2212.07140

zbMATH Keywords

plane curvesparity conditioncircle graphsinterlacement graphsrealization of Gauss diagrams

Mathematics Subject Classification ID

Plane and space curves (14H50) Knot theory (57K10) Generalized knots (virtual knots, welded knots, quandles, etc.) (57K12)

Cites Work

• Unnamed Item
• Unnamed Item
• Chords in a circle and linear algebra over GF(2)
• On the realization of double occurrence words
• On a characterization of Gauss codes
• Counting modulo quantifiers on finite structures
• \texttt{Gauss-lintel}, an algorithm suite for exploring chord diagrams
• Framed 4-graphs: Euler tours, Gauss circuits and rotating circuits
• On realizabilty of Gauss diagrams and constructions of meanders
• AN EXTENSION OF THE JONES POLYNOMIAL OF CLASSICAL KNOTS
• Gauss codes, planar hamiltonian graphs, and stack-sortable permutations
• A forbidden substructure characterization of Gauss codes
• Recognition of Circle Graphs
• THE PLANARITY PROBLEM FOR SIGNED GAUSS WORDS
• Parity conditions for realizability of Gauss diagrams
• THE PLANARITY PROBLEM II
• A Singular Mathematical Promenade

This page was built for publication: Describing realizable Gauss diagrams using the concepts of parity or bipartite graphs