On the public citation graph

Computing Higher Graph Gonality is Hard

0 signed · 14 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 this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/s00209-007-0222-4openalex-extracted
A Riemann–Roch theorem in tropical geometry
inferredcites →https://doi.org/10.1007/s00224-020-10019-4openalex-extracted
Stable Divisorial Gonality is in NP
inferredcites →https://doi.org/10.1016/j.aim.2007.04.012openalex-extracted
Riemann–Roch and Abel–Jacobi theory on a finite graph
inferredcites →https://doi.org/10.1016/j.aim.2012.02.019openalex-extracted
A tropical proof of the Brill–Noether Theorem
inferredcites →https://doi.org/10.1016/j.dam.2020.08.013openalex-extracted
Computing graph gonality is hard
inferredcites →https://doi.org/10.1016/j.dam.2021.12.009openalex-extracted
On the scramble number of graphs
inferredcites →https://doi.org/10.1016/j.jcta.2022.105619openalex-extracted
Discrete and metric divisorial gonality can be different
inferredcites →https://doi.org/10.1016/s0304-3975(98)00158-3openalex-extracted
Some APX-completeness results for cubic graphs
inferredcites →https://doi.org/10.1090/conm/465/09104openalex-extracted
Tropical curves, their Jacobians and theta functions
inferredcites →https://doi.org/10.1103/physrevlett.64.1613openalex-extracted
Self-organized critical state of sandpile automaton models
inferredcites →https://doi.org/10.1137/0132071openalex-extracted
The Rectilinear Steiner Tree Problem is $NP$-Complete
inferredcites →https://doi.org/10.1137/20m1323072openalex-extracted
Gonality Sequences of Graphs
inferredcites →https://doi.org/10.2140/ant.2008.2.613openalex-extracted
Specialization of linear systems from curves to graphs
inferredcites →https://doi.org/10.5802/alco.124openalex-extracted
Treewidth is a lower bound on graph gonality
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.