On the public citation graph

A Large Set of Torus Obstructions and How They Were Discovered

https://doi.org/10.37236/3797
0 signed · 15 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.
Claim with ORCID
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.
See reference health

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.70028openalex-snapshot
On Delta‐Wye Reducibility of Toroidal Graphs
inferred← citeshttps://doi.org/10.1007/s13370-025-01323-8openalex-snapshot
Klein book embeddings
inferred← citeshttps://doi.org/10.1016/j.aam.2025.102864openalex-snapshot
The excluded minors for GF(5)-representable matroids on ten elements
inferred← citeshttps://doi.org/10.1016/j.dam.2024.08.022openalex-snapshot
Dips at small sizes for topological graph obstruction sets
inferred← citeshttps://doi.org/10.1109/focs.2018.00074openalex-snapshot
Efficient Polynomial-Time Approximation Scheme for the Genus of Dense Graphs
inferred← citeshttps://doi.org/10.1142/s0219498820500991openalex-snapshot
Characterization of groups with planar, toroidal or projective planar (proper) reduced power graphs
inferred← citeshttps://doi.org/10.1145/3690821openalex-snapshot
Efficient polynomial-time approximation scheme for the genus of dense graphs
inferred← citeshttps://doi.org/10.21105/joss.11163openalex-snapshot
Edge Addition Planarity Suite and Generalized Graph Library
inferred← citeshttps://doi.org/10.2140/involve.2022.15.669openalex-snapshot
Family sizes for complete multipartite graphs
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.4611openalex-snapshot
Two Results in Drawing Graphs on Surfaces
inferred← citeshttps://doi.org/10.37236/8816openalex-snapshot
Non-Separating Planar Graphs
inferred← citeshttps://doi.org/10.61091/jcmcc119-22openalex-snapshot
Some Excluded Minors for the Spindle Surface
inferred← citeshttps://doi.org/10.70675/c0b93ddcz747cz4e2fzb2a1zdccd7008991dopenalex-snapshot
Drawing graphs on surfaces of null and higher genus
inferred← citeshttps://doi.org/10.70675/e9de8f94zbf4dz4dacza8bfz2a4977c31129openalex-snapshot
Trees, Decompositions, and Knot theory
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.