On the public citation graph
Non-Separating Planar Graphs
0 signed · 23 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.1002/jgt.1023openalex-snapshot
Obstruction sets for outer‐cylindrical graphs
inferredcites →https://doi.org/10.1002/jgt.3190050305openalex-snapshot
A kuratowski theorem for the projective plane
inferredcites →https://doi.org/10.1002/jgt.3190070410openalex-snapshot
Knots and links in spatial graphs
inferredcites →https://doi.org/10.1006/jctb.1995.1032openalex-snapshot
Sachs′ Linkless Embedding Conjecture
inferredcites →https://doi.org/10.1007/bfb0071633openalex-snapshot
On a spatial analogue of Kuratowski's theorem on planar graphs — An open problem
inferredcites →https://doi.org/10.1090/conm/147/01167openalex-snapshot
A survey of linkless embeddings
inferredcites →https://doi.org/10.1145/1810959.1810975openalex-snapshot
Linkless and flat embeddings in 3-space and the unknot problem
inferredcites →https://doi.org/10.37236/3797openalex-snapshot
A Large Set of Torus Obstructions and How They Were Discovered
inferredcites →https://doi.org/10.4064/fm-15-1-271-283openalex-snapshot
Sur le problème des courbes gauches en Topologie
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.22703openalex-snapshot
On the number of edges in maximally linkless graphs
inferred← citeshttps://doi.org/10.1002/jgt.22705openalex-snapshot
Edge‐maximal graphs on orientable and some nonorientable surfaces
inferred← citeshttps://doi.org/10.1007/s00013-026-02279-2openalex-snapshot
Intrinsic linking of a simplicial n-complex embedded in $$\mathbb {R}^{2n}$$
inferred← citeshttps://doi.org/10.1017/s0963548326100522openalex-snapshot
Optimal tree-decompositions with bags of bounded treewidth
inferred← citeshttps://doi.org/10.2140/agt.2023.23.2545openalex-snapshot
New bounds on maximal linkless graphs
inferred← citeshttps://doi.org/10.2140/agt.2024.24.555openalex-snapshot
Constructions stemming from nonseparating planar graphs and their Colin de Verdière invariant
inferred← citeshttps://doi.org/10.2140/involve.2023.16.505openalex-snapshot
Complete minors in complements of nonseparating planar graphs
inferred← citeshttps://doi.org/10.2140/involve.2025.18.199openalex-snapshot
Links in projective planar graphs
inferred← citeshttps://doi.org/10.4230/lipics.socg.2021.38openalex-snapshot
Strong Hanani-Tutte for the Torus
inferred← citeshttps://doi.org/10.48550/arxiv.2107.08953openalex-snapshot
Intrinsically spherical 3-linked graphs
inferred← citeshttps://doi.org/10.7155/jgaa.v28i1.2930openalex-snapshot
Thrackles, Superthrackles and the Hanani-Tutte Theorem
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.