Sparse Graphs of High Gonality

DOI10.1137/16M1095329zbMath1388.05105arXiv1606.06412WikidataQ129696347 ScholiaQ129696347MaRDI QIDQ4568093

Kevin Hendrey

Publication date: 15 June 2018

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.06412

zbMATH Keywords

treewidthdivisorial gonality

Mathematics Subject Classification ID

Density (toughness, etc.) (05C42)

Related Items (7)

Treewidth and gonality of glued grid graphs ⋮ Computing graph gonality is hard ⋮ Recognizing hyperelliptic graphs in polynomial time ⋮ Constructing tree decompositions of graphs with bounded gonality ⋮ Constructing tree decompositions of graphs with bounded gonality ⋮ A new lower bound on graph gonality ⋮ Brill-Noether conjecture on cactus graphs

Cites Work

• Unnamed Item
• Riemann-Roch theory for weighted graphs and tropical curves
• A tropical proof of the Brill-Noether theorem
• Specialization of linear systems from curves to graphs (with an appendix by Brian Conrad)
• A partial k-arboretum of graphs with bounded treewidth
• On metric graphs with prescribed gonality
• Riemann-Roch for sub-lattices of the root lattice \(A_n\)
• Algebraic and combinatorial rank of divisors on finite graphs
• Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph
• Riemann-Roch and Abel-Jacobi theory on a finite graph
• Gonality of random graphs
• A Riemann-Roch theorem for edge-weighted graphs
• New tools and results in graph minor structure theory
• A Spectral Lower Bound for the Divisorial Gonality of Metric Graphs

This page was built for publication: Sparse Graphs of High Gonality