The following pages link to Sparse Graphs of High Gonality (Q4568093):
Displayed 7 items.
- Computing graph gonality is hard (Q2004086) (← links)
- A new lower bound on graph gonality (Q2065783) (← links)
- Brill-Noether conjecture on cactus graphs (Q2080340) (← links)
- Treewidth and gonality of glued grid graphs (Q2181210) (← links)
- Constructing tree decompositions of graphs with bounded gonality (Q5918255) (← links)
- Constructing tree decompositions of graphs with bounded gonality (Q5918526) (← links)
- Recognizing hyperelliptic graphs in polynomial time (Q5919531) (← links)