The classical Gauss code problem asks to characterize which cyclic sequences arise as the vertex sequence of the straight-ahead path of a 4-regular graph embedded in the plane. This problem is generalized to certain 4-regular graphs in arbitrary surfaces. A characterization is given for the existence of a 4-regular graph in a specified surface yielding the specified sequence. This characterization is obtained using a generalization of Shank's left-right paths.
Recommendations
Cited in
(24)- Bicycles and left-right tours in locally finite graphs
- Realizations with a cut-through Eulerian circuit
- Equivalence of edge bicolored graphs on surfaces
- Embeddings of 4-valent framed graphs into 2-surfaces
- A new proof of the Gauss interlace conjecture
- Straight-ahead walks in Eulerian graphs
- A homological solution for the Gauss code problem in arbitrary surfaces
- Embeddings of four-valent framed graphs into 2-surfaces
- Framed 4-graphs: Euler tours, Gauss circuits and rotating circuits
- scientific article; zbMATH DE number 4204362 (Why is no real title available?)
- Graphs 2-cell embedded in non-orientable surfaces and their coding sequences
- 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 1156658 (Why is no real title available?)
- scientific article; zbMATH DE number 1995177 (Why is no real title available?)
- Parity in knot theory and graph-links
- Parity conditions for realizability of Gauss diagrams
- On Gauss codes of virtual doodles
- scientific article; zbMATH DE number 2116354 (Why is no real title available?)
- The common structure of the curves having a same Gauss word
- \(A\)-trails of embedded graphs and twisted duals
- Coding sequences and Euler's formula for graphs on surfaces
- Spanning trees, Euler tours, medial graphs, left-right paths and cycle spaces
- Series parallel extensions of plane graphs to dual-Eulerian graphs
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)
