2 citations · 2 across the 1 of their papers we have counts for
2 papers
cs.DM2018★ 2 cited
Stable gonality is computable
Ragnar Groot Koerkamp, Marieke van der Wegen
Stable gonality is a multigraph parameter that measures the complexity of a graph. It is defined using maps to trees. Those maps, in some sense, divide the edges equally over the e…
cs.DS2017
Recognizing hyperelliptic graphs in polynomial time
Jelco M. Bodewes, Hans L. Bodlaender, Gunther Cornelissen +1
Recently, a new set of multigraph parameters was defined, called "gonalities". Gonality bears some similarity to treewidth, and is a relevant graph parameter for problems in number…