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: | , |
|---|---|
| פורמט: | Article |
| שפה: | English |
| יצא לאור: |
Discrete Mathematics & Theoretical Computer Science
2019-06-01
|
| סדרה: | Discrete Mathematics & Theoretical Computer Science |
| נושאים: | |
| גישה מקוונת: | https://dmtcs.episciences.org/4931/pdf |