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...
Prif Awduron: | Ragnar Groot Koerkamp, Marieke van der Wegen |
---|---|
Fformat: | Erthygl |
Iaith: | English |
Cyhoeddwyd: |
Discrete Mathematics & Theoretical Computer Science
2019-06-01
|
Cyfres: | Discrete Mathematics & Theoretical Computer Science |
Pynciau: | |
Mynediad Ar-lein: | https://dmtcs.episciences.org/4931/pdf |
Eitemau Tebyg
-
Destroying Multicolored Paths and Cycles in Edge-Colored Graphs
gan: Nils Jakob Eckstein, et al.
Cyhoeddwyd: (2023-03-01) -
Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs
gan: Kenjiro Takazawa
Cyhoeddwyd: (2022-03-01) -
Destroying Bicolored $P_3$s by Deleting Few Edges
gan: Niels Grüttemeier, et al.
Cyhoeddwyd: (2021-06-01) -
On the shelling antimatroids of split graphs
gan: Jean Cardinal, et al.
Cyhoeddwyd: (2017-03-01) -
On the multipacking number of grid graphs
gan: Laurent Beaudou, et al.
Cyhoeddwyd: (2019-06-01)