Stable gonality is computable
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 edges of the tree; stable gonality asks for the map with the minimum number of edges mapped to each edge of the tree. Thi...
Main Authors: | Ragnar Groot Koerkamp, Marieke van der Wegen |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2019-06-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/4931/pdf |
Similar Items
-
Destroying Multicolored Paths and Cycles in Edge-Colored Graphs
by: Nils Jakob Eckstein, et al.
Published: (2023-03-01) -
Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs
by: Kenjiro Takazawa
Published: (2022-03-01) -
Destroying Bicolored $P_3$s by Deleting Few Edges
by: Niels Grüttemeier, et al.
Published: (2021-06-01) -
On the shelling antimatroids of split graphs
by: Jean Cardinal, et al.
Published: (2017-03-01) -
On the multipacking number of grid graphs
by: Laurent Beaudou, et al.
Published: (2019-06-01)