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...

詳細記述

書誌詳細
主要な著者: Ragnar Groot Koerkamp, Marieke van der Wegen
フォーマット: 論文
言語:English
出版事項: Discrete Mathematics & Theoretical Computer Science 2019-06-01
シリーズ:Discrete Mathematics & Theoretical Computer Science
主題:
オンライン・アクセス:https://dmtcs.episciences.org/4931/pdf

類似資料