On the public citation graph
Dips at Small Sizes for Topological Graph Obstruction Sets
0 signed · 26 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.22091openalex-extracted
Bipartite Intrinsically Knotted Graphs with 22 Edges
inferredcites →https://doi.org/10.1002/jgt.3190050305openalex-extracted
A kuratowski theorem for the projective plane
inferredcites →https://doi.org/10.1002/jgt.3190070410openalex-extracted
Knots and links in spatial graphs
inferredcites →https://doi.org/10.1006/jctb.1995.1032openalex-extracted
Sachs′ Linkless Embedding Conjecture
inferredcites →https://doi.org/10.1007/s00373-015-1611-9openalex-extracted
Excluded-Minor Characterization of Apex-Outerplanar Graphs
inferredcites →https://doi.org/10.1016/0095-8956(79)90022-4openalex-extracted
103 Graphs that are irreducible for the projective plane
inferredcites →https://doi.org/10.1016/j.jctb.2004.08.001openalex-extracted
Graph Minors. XX. Wagner's conjecture
inferredcites →https://doi.org/10.1016/s0166-8641(99)00228-xopenalex-extracted
Realization of knots and links in a spatial graph
inferredcites →https://doi.org/10.1080/10586458.2014.852033openalex-extracted
An Algorithm for Detecting Intrinsically Knotted Graphs
inferredcites →https://doi.org/10.1090/conm/689/13845openalex-extracted
Recent developments in spatial graph theory
inferredcites →https://doi.org/10.1142/s021821650700552xopenalex-extracted
SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS
inferredcites →https://doi.org/10.1515/9783110875911.435openalex-extracted
Some remarks on knots and links in spatial graphs
inferredcites →https://doi.org/10.2140/agt.2011.11.691openalex-extracted
Graphs of 20 edges are 2–apex, hence unknotted
inferredcites →https://doi.org/10.2140/agt.2014.14.1801openalex-extracted
Many, many more intrinsically knotted graphs
inferredcites →https://doi.org/10.2140/agt.2024.24.1203openalex-extracted
Intrinsically knotted graphs with linklessly embeddable simple minors
inferredcites →https://doi.org/10.2140/involve.2016.9.591openalex-extracted
Graphs on 21 edges that are not 2-apex
inferredcites →https://doi.org/10.2140/involve.2018.11.413openalex-extracted
Six variations on a theme: almost planar graphs
inferredcites →https://doi.org/10.2140/pjm.2011.252.407openalex-extracted
On intrinsically knotted or completely 3-linked graphs
inferredcites →https://doi.org/10.37236/3797openalex-extracted
A Large Set of Torus Obstructions and How They Were Discovered
inferredcites →https://doi.org/10.37236/8382openalex-extracted
All Minor-Minimal Apex Obstructions with Connectivity Two
inferredcites →https://doi.org/10.4064/fm-15-1-271-283openalex-extracted
Sur le problème des courbes gauches en Topologie
inferredcites →https://doi.org/10.48550/arxiv.math/0701422openalex-extracted
Intrinsic knotting and linking of almost complete graphs
inferredcites →https://doi.org/10.5209/rev_rema.2007.v20.n2.16496openalex-extracted
Primitive Spatial Graphs and Graph Minors
inferredcites →https://doi.org/10.1002/jgt.1023openalex-snapshot
Obstruction sets for outer‐cylindrical graphs
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.