THE PLANARITY PROBLEM II
From MaRDI portal
Publication:4894141
Recommendations
Cited in
(21)- 2-colored diagrams of knots
- Embeddings of 4-valent framed graphs into 2-surfaces
- \texttt{Gauss-lintel}, an algorithm suite for exploring chord diagrams
- A certain topological problem of Gauss
- Virtual knot groups and almost classical knots
- An equivalence between the set of graph-knots and the set of homotopy classes of looped graphs
- On realizability of Gauss diagrams and constructions of meanders
- Automata on Gauss Words
- THE PLANARITY PROBLEM FOR SIGNED GAUSS WORDS
- GAUSS WORDS OF CURVES ON A TORUS
- Parity in knot theory and graph-links
- Parity conditions for realizability of Gauss diagrams
- The planar approximation. II
- The common structure of the curves having a same Gauss word
- Picture-valued parity-biquandle bracket
- Finite type invariants of nanowords and nanophrases
- Describing realizable Gauss diagrams using the concepts of parity or bipartite graphs
- The expected genus of a random chord diagram
- Outerplanar thrackles
- Skew-symmetric augmented matrices and a characterization of virtual doodles
- Genus ranges of 4-regular rigid vertex graphs
This page was built for publication: THE PLANARITY PROBLEM II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4894141)