On the public citation graph
The Gauss code problem off the plane
0 signed · 21 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/s0167-5060(08)70508-9openalex-snapshot
On the Principal Edge Tripartition of a Graph
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199603)21:3<301::aid-jgt4>3.0.co;2-uopenalex-snapshot
Walks through every edge exactly twice II
inferred← citeshttps://doi.org/10.1002/jgt.3190180710openalex-snapshot
Walks through every edge exactly twice
inferred← citeshttps://doi.org/10.1006/aama.1999.0643openalex-snapshot
A New Proof of the Gauss Interlace Conjecture
inferred← citeshttps://doi.org/10.1007/978-3-319-09039-9_1openalex-snapshot
The Common Structure of the Curves Having a Same Gauss Word
inferred← citeshttps://doi.org/10.1007/978-3-642-15637-3_7openalex-snapshot
Embeddings of Four-valent Framed Graphs into 2-surfaces
inferred← citeshttps://doi.org/10.1007/s10958-013-1499-yopenalex-snapshot
Parity in knot theory and graph-links
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90119-mopenalex-snapshot
Spanning trees, Euler tours, medial graphs, left-right paths and cycle spaces
inferred← citeshttps://doi.org/10.1016/0012-365x(93)e0129-ropenalex-snapshot
Realizations with a cut-through Eulerian circuit
inferred← citeshttps://doi.org/10.1016/j.disc.2003.09.011openalex-snapshot
Straight-ahead walks in Eulerian graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2005.09.048openalex-snapshot
Series parallel extensions of plane graphs to dual-eulerian graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2008.06.002openalex-snapshot
Bicycles and left–right tours in locally finite graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2007.08.007openalex-snapshot
A homological solution for the Gauss code problem in arbitrary surfaces
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00061-9openalex-snapshot
Plane graphs with Eulerian Petrie walks
inferred← citeshttps://doi.org/10.1134/s1064562409010165openalex-snapshot
Embeddings of 4-valent framed graphs into 2-surfaces
inferred← citeshttps://doi.org/10.26493/1855-3974.2053.c7bopenalex-snapshot
A-trails of embedded graphs and twisted duals
inferred← citeshttps://doi.org/10.48550/arxiv.0807.1311openalex-snapshot
Cohomology and Immersed Curves
inferred← citeshttps://doi.org/10.48550/arxiv.math/0301012openalex-snapshot
An Affine Linear Solution for the 2-Face Colorable Gauss Code Problem in the Klein Bottle and a Quadratic System for Arbitrary Closed Surfaces
inferred← citeshttps://doi.org/10.48550/arxiv.math/0301053openalex-snapshot
On Maps with a Single Zigzag
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.