The Gauss code problem off the plane
DOI10.1007/BF01836154zbMATH Open0591.05024OpenAlexW2085363761MaRDI QIDQ1074591FDOQ1074591
R. B. Richter, Sóstenes Lins, Herbert S. Shank
Publication date: 1987
Published in: Aequationes Mathematicae (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/137205
Recommendations
arbitrary surfaces4-regular graph embedded in the planecyclic sequencesGauss code problemShank's left-right pathsvertex sequence
Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Theory of error-correcting codes and error-detecting codes (94B99)
Cites Work
Cited In (21)
- A-trails of embedded graphs and twisted duals
- Gauss codes, planar hamiltonian graphs, and stack-sortable permutations
- Title not available (Why is that?)
- Bicycles and left-right tours in locally finite graphs
- Title not available (Why is that?)
- The Common Structure of the Curves Having a Same Gauss Word
- Coding sequences and Euler's formula for graphs on surfaces
- Equivalence of edge bicolored graphs on surfaces
- Series parallel extensions of plane graphs to dual-Eulerian graphs
- Parity in knot theory and graph-links
- A new proof of the Gauss interlace conjecture
- Title not available (Why is that?)
- Straight-ahead walks in Eulerian graphs
- A homological solution for the Gauss code problem in arbitrary surfaces
- Realizations with a cut-through Eulerian circuit
- Embeddings of Four-valent Framed Graphs into 2-surfaces
- Graphs 2-cell embedded in non-orientable surfaces and their coding sequences
- Title not available (Why is that?)
- Parity conditions for realizability of Gauss diagrams
- Embeddings of 4-valent framed graphs into 2-surfaces
- Spanning trees, Euler tours, medial graphs, left-right paths and cycle spaces
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)
