On the realization of double occurrence words

DOI10.1016/j.disc.2008.02.035zbMath1205.05006arXiv0709.2933OpenAlexW1974972090MaRDI QIDQ1024503

Lorenzo Traldi, Louis Zulli, Blerta Shtylla

Publication date: 17 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

orthogonal projectionchord diagraminterlacement graphcircle graphGauss codedouble occurrence wordorthoprojection graph

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (9)

\texttt{Gauss-lintel}, an algorithm suite for exploring chord diagrams ⋮ A tight relation between series-parallel graphs and bipartite distance hereditary graphs ⋮ Topological realizations of ortho-projection graphs ⋮ Orientation-preserving and orientation-reversing mappings: a new description ⋮ Transformations of assembly number for 4-regular graphs ⋮ Comment on `Šilnikov-type orbits of Lorenz-family systems' ⋮ Describing realizable Gauss diagrams using the concepts of parity or bipartite graphs ⋮ Finite type invariants of nanowords and nanophrases ⋮ Symbol Separation in Double Occurrence Words

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a characterization of Gauss codes
• Circle graph obstructions
• A new proof of the Gauss interlace conjecture
• Virtual knot theory
• Introduction to Vassiliev Knot Invariants
• AN EXTENSION OF THE JONES POLYNOMIAL OF CLASSICAL KNOTS
• A MATRIX INVARIANT OF CURVES IN S²
• The Gauss Realizability Problem
• On lacets and their manifolds

This page was built for publication: On the realization of double occurrence words