On the public citation graph
Treewidth is a lower bound on graph gonality
0 signed · 43 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.1006/jctb.1993.1027openalex-snapshot
Graph Searching and a Min-Max Theorem for Tree-Width
inferredcites →https://doi.org/10.1007/978-3-319-05404-9_4openalex-snapshot
Gonality of Algebraic Curves and Graphs
inferredcites →https://doi.org/10.1007/s00209-007-0222-4openalex-snapshot
A Riemann–Roch theorem in tropical geometry
inferredcites →https://doi.org/10.1016/0095-8956(90)90120-oopenalex-snapshot
Graph minors. IV. Tree-width and well-quasi-ordering
inferredcites →https://doi.org/10.1016/j.jcta.2011.03.002openalex-snapshot
Rank-determining sets of metric graphs
inferredcites →https://doi.org/10.1016/j.jcta.2013.05.002openalex-snapshot
Rank of divisors on tropical curves
inferredcites →https://doi.org/10.1093/imrn/rnp037openalex-snapshot
Harmonic Morphisms and Hyperelliptic Graphs
inferredcites →https://doi.org/10.2140/ant.2008.2.613openalex-snapshot
Specialization of linear systems from curves to graphs
inferredcites →https://doi.org/10.48550/arxiv.1211.2681openalex-snapshot
A combinatorial Li-Yau inequality and rational points on curves
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.4777786openalex-extracted
Computing Higher Graph Gonality is Hard
inferred← citeshttps://doi.org/10.1007/978-3-030-00256-5_5openalex-snapshot
Recognizing Hyperelliptic Graphs in Polynomial Time
inferred← citeshttps://doi.org/10.1007/978-3-030-10801-4_8openalex-snapshot
Stable Divisorial Gonality is in NP
inferred← citeshttps://doi.org/10.1007/978-3-030-37853-0_4openalex-snapshot
Chip-Firing Games and Critical Groups
inferred← citeshttps://doi.org/10.1007/978-3-030-58150-3_31openalex-snapshot
Constructing Tree Decompositions of Graphs with Bounded Gonality
inferred← citeshttps://doi.org/10.1007/978-3-031-15914-5_7openalex-snapshot
Problems Hard for Treewidth but Easy for Stable Gonality
inferred← citeshttps://doi.org/10.1007/s00224-020-10019-4openalex-snapshot
Stable Divisorial Gonality is in NP
inferred← citeshttps://doi.org/10.1007/s10623-025-01674-0openalex-snapshot
On the treewidth of generalized q-Kneser graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2019.10.024openalex-snapshot
Treewidth and gonality of glued grid graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2021.11.003openalex-snapshot
A new lower bound on graph gonality
inferred← citeshttps://doi.org/10.1016/j.dam.2021.12.009openalex-snapshot
On the scramble number of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114186openalex-snapshot
The gonality of queen's graphs
inferred← citeshttps://doi.org/10.1016/j.jcta.2017.11.017openalex-snapshot
On metric graphs with prescribed gonality
inferred← citeshttps://doi.org/10.1016/j.jcta.2022.105619openalex-snapshot
Discrete and metric divisorial gonality can be different
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.02.013openalex-snapshot
Recognizing hyperelliptic graphs in polynomial time
inferred← citeshttps://doi.org/10.1090/proc/13498openalex-snapshot
On the complexity of the chip-firing reachability problem
inferred← citeshttps://doi.org/10.1093/imrn/rnv213openalex-snapshot
A Spectral Lower Bound for the Divisorial Gonality of Metric Graphs
inferred← citeshttps://doi.org/10.1307/mmj/1519095622openalex-snapshot
A Note on Brill–Noether Existence for Graphs of Low Genus
inferred← citeshttps://doi.org/10.14445/22315373/ijmtt-v70i3p102openalex-snapshot
Quasi-Ultrafilter on the Connectivity System: Its Relationship to Branch-Decomposition
inferred← citeshttps://doi.org/10.33540/709openalex-snapshot
Complexity of Graph Problems: Gonality, Colouring and Scheduling
inferred← citeshttps://doi.org/10.36934/tr2021_198openalex-snapshot
Multiplicity-Free Gonality on Graphs
inferred← citeshttps://doi.org/10.37236/9307openalex-snapshot
On the Gonality of Cartesian Products of Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1704.06255openalex-snapshot
On the gonality, treewidth, and orientable genus of a graph
inferred← citeshttps://doi.org/10.48550/arxiv.2108.09821openalex-snapshot
Uniform scrambles on graphs
inferred← citeshttps://doi.org/10.5614/ejgta.2023.11.2.2openalex-snapshot
Multiplicity-free gonality on 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.