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
格式: 文件
语言:English
出版: Discrete Mathematics & Theoretical Computer Science 2019-06-01
丛编:Discrete Mathematics & Theoretical Computer Science
主题:
在线阅读:https://dmtcs.episciences.org/4931/pdf

相似书籍