The Gauss code problem off the plane
From MaRDI portal
Publication:1074591
Recommendations
Cited in
(23)- Framed 4-graphs: Euler tours, Gauss circuits and rotating circuits
- Graphs 2-cell embedded in non-orientable surfaces and their coding sequences
- Parity in knot theory and graph-links
- A new proof of the Gauss interlace conjecture
- Parity conditions for realizability of Gauss diagrams
- The common structure of the curves having a same Gauss word
- scientific article; zbMATH DE number 4204362 (Why is no real title available?)
- Gauss codes, planar hamiltonian graphs, and stack-sortable permutations
- scientific article; zbMATH DE number 3557793 (Why is no real title available?)
- scientific article; zbMATH DE number 1995177 (Why is no real title available?)
- Embeddings of 4-valent framed graphs into 2-surfaces
- Bicycles and left-right tours in locally finite graphs
- Straight-ahead walks in Eulerian graphs
- Spanning trees, Euler tours, medial graphs, left-right paths and cycle spaces
- Realizations with a cut-through Eulerian circuit
- Series parallel extensions of plane graphs to dual-Eulerian graphs
- A homological solution for the Gauss code problem in arbitrary surfaces
- scientific article; zbMATH DE number 2116354 (Why is no real title available?)
- Embeddings of four-valent framed graphs into 2-surfaces
- \(A\)-trails of embedded graphs and twisted duals
- On Gauss codes of virtual doodles
- Equivalence of edge bicolored graphs on surfaces
- Coding sequences and Euler's formula for graphs on surfaces
This page was built for publication: The Gauss code problem off the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1074591)