论文标题
争夺编号和砍伐的分解
Scramble number and tree-cut decompositions
论文作者
论文摘要
图形的争夺数是最近开发的，用于研究筹码游戏和分区的性格。在本文中，我们基于现有的有关树切分解的文献的变化介绍了图的screewidth。我们证明，这种不变的是在争夺数字上的上限，尽管它们并不总是相等的。我们研究了screewidth的特性，并在其与分区的性质有关的结果和猜想中提出了猜想。
The scramble number of a graph is an invariant recently developed to study chip-firing games and divisorial gonality. In this paper we introduce the screewidth of a graph, based on a variation of the existing literature on tree-cut decompositions. We prove that this invariant serves as an upper bound on scramble number, though they are not always equal. We study properties of screewidth, and present results and conjectures on its connection to divisorial gonality.
