Parity conditions for realizability of Gauss diagrams
From MaRDI portal
Publication:4623293
DOI10.1142/S0218216519500159zbMath1448.57004MaRDI QIDQ4623293
Publication date: 14 February 2019
Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)
Related Items (2)
\texttt{Gauss-lintel}, an algorithm suite for exploring chord diagrams ⋮ Describing realizable Gauss diagrams using the concepts of parity or bipartite graphs
Cites Work
- Unnamed Item
- The Gauss code problem off the plane
- On a characterization of Gauss codes
- Framed 4-graphs: Euler tours, Gauss circuits and rotating circuits
- On realizabilty of Gauss diagrams and constructions of meanders
- A forbidden substructure characterization of Gauss codes
- THE PLANARITY PROBLEM FOR SIGNED GAUSS WORDS
- THE PLANARITY PROBLEM II
- A proof of Vassiliev's conjecture on the planarity of singular links
This page was built for publication: Parity conditions for realizability of Gauss diagrams