Brill-Noether conjecture on cactus graphs
From MaRDI portal
Publication:2080340
DOI10.1007/s40306-021-00475-6zbMath1498.05146OpenAlexW4220861346WikidataQ113898749 ScholiaQ113898749MaRDI QIDQ2080340
Publication date: 7 October 2022
Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40306-021-00475-6
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Arithmetic ground fields for curves (14H25) Divisors, linear systems, invertible sheaves (14C20)
Cites Work
- Unnamed Item
- On computation of Baker and Norine's rank on complete graphs
- A tropical proof of the Brill-Noether theorem
- Memory efficient algorithms for cactus graphs and block graphs
- Chip-firing games on graphs
- Specialization of linear systems from curves to graphs (with an appendix by Brian Conrad)
- Chip-firing and the critical group of a graph
- On metric graphs with prescribed gonality
- Fair domination number in cactus graphs
- A note on Brill-Noether existence for graphs of low genus
- The 2-maxian problem on cactus graphs
- Riemann-Roch and Abel-Jacobi theory on a finite graph
- Algebraic and combinatorial Brill-Noether theory
- Harmonic Morphisms and Hyperelliptic Graphs
- Maximal k-independent sets in graphs
- Self-organized critical state of sandpile automaton models
- Sparse Graphs of High Gonality
- On the Number of Husimi Trees
This page was built for publication: Brill-Noether conjecture on cactus graphs