On the public citation graph
Graphs on 21 edges that are not 2-apex
0 signed · 33 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/(sici)1097-0118(199902)30:2<137::aid-jgt7>3.0.co;2-gopenalex-snapshot
Fast generation of regular graphs and construction of cages
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/bf01594196openalex-snapshot
Über eine Eigenschaft der ebenen Komplexe
inferredcites →https://doi.org/10.1007/s00373-015-1611-9openalex-snapshot
Excluded-Minor Characterization of Apex-Outerplanar Graphs
inferredcites →https://doi.org/10.1016/j.jctb.2004.08.001openalex-snapshot
Graph Minors. XX. Wagner's conjecture
inferredcites →https://doi.org/10.1142/s021821650700552xopenalex-snapshot
SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS
inferredcites →https://doi.org/10.1142/s0218216510008455openalex-snapshot
INTRINSICALLY KNOTTED GRAPHS HAVE AT LEAST 21 EDGES
inferredcites →https://doi.org/10.1515/9783110875911.435openalex-snapshot
Some remarks on knots and links in spatial graphs
inferredcites →https://doi.org/10.2140/agt.2011.11.691openalex-snapshot
Graphs of 20 edges are 2–apex, hence unknotted
inferredcites →https://doi.org/10.2140/agt.2014.14.1801openalex-snapshot
Many, many more intrinsically knotted graphs
inferredcites →https://doi.org/10.2140/agt.2015.15.3305openalex-snapshot
Exactly fourteen intrinsically knotted graphs have 21 edges
inferredcites →https://doi.org/10.2140/pjm.2011.252.407openalex-snapshot
On intrinsically knotted or completely 3-linked graphs
inferredcites →https://doi.org/10.31390/gradschool_dissertations.3102openalex-snapshot
Excluded-minor characterization of apex-outerplanar graphs
inferredcites →https://doi.org/10.48550/arxiv.1303.6911openalex-snapshot
Intrinsically knotted graphs with 21 edges
inferredcites →https://doi.org/10.48550/arxiv.math/0701422openalex-snapshot
Intrinsic knotting and linking of almost complete graphs
inferredcites →https://doi.org/10.5209/rev_rema.2007.v20.n2.16496openalex-snapshot
Primitive Spatial Graphs and Graph Minors
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4494887openalex-extracted
Dips at Small Sizes for Topological Graph Obstruction Sets
inferred← citeshttps://doi.org/10.1002/jgt.22091openalex-snapshot
Bipartite Intrinsically Knotted Graphs with 22 Edges
inferred← citeshttps://doi.org/10.1007/978-3-319-66065-3_4openalex-snapshot
Forbidden Minors: Finding the Finite Few
inferred← citeshttps://doi.org/10.1007/s10910-022-01398-9openalex-snapshot
Chirality for simple graphs of size up to 12
inferred← citeshttps://doi.org/10.1016/j.dam.2020.12.009openalex-snapshot
The minor minimal intrinsically chiral graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2022.113022openalex-snapshot
Bipartite intrinsically knotted graphs with 23 edges
inferred← citeshttps://doi.org/10.1016/j.topol.2017.06.013openalex-snapshot
A new intrinsically knotted graph with 22 edges
inferred← citeshttps://doi.org/10.1090/conm/689/13845openalex-snapshot
Recent developments in spatial graph theory
inferred← citeshttps://doi.org/10.1090/conm/689/13856openalex-snapshot
The 𝐾_{𝑛+5} and 𝐾_{3²,1ⁿ} families and obstructions to 𝑛-apex.
inferred← citeshttps://doi.org/10.1142/s0218216518500591openalex-snapshot
More intrinsically knotted graphs with 22 edges and the restoring method
inferred← citeshttps://doi.org/10.2140/involve.2018.11.413openalex-snapshot
Six variations on a theme: almost planar graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1603.00885openalex-snapshot
The $K_{n+5}$ and $K_{3^2,1^n}$ families are obstructions to $n$-apex
inferred← citeshttps://doi.org/10.48550/arxiv.2006.07342openalex-snapshot
On intrinsically knotted and linked 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.