Maxine启发式产生最大独立集的图
Graphs in which the Maxine heuristic produces a maximum independent set
摘要：
一个图的剩余是迭代地将Havel-Hakimi算法应用于其度序列后剩下的零的数量。Favaron、Mahéo和Saclé证明了剩余是独立数的下界。Maxine启发式算法将图简化为大小为$M$的独立集。它已被证明，给定一个图$G$，$M$是有界的独立数和剩余的图的任何应用的Maxine启发式。我们改进了图的一个禁止子图分类，使得$M$等于Barrus和Molnar在2015年给出的独立数.
英文摘要：
The residue of a graph is the number of zeros left after iteratively applying the Havel-Hakimi algorithm to its degree sequence. Favaron, Mahéo, and Saclé showed that the residue is a lower bound on the independence number. The Maxine heuristic reduces a graph to an independent set of size $M$. It has been shown that given a graph $G$, $M$ is bounded between the independence number and the residue of a graph for any application of the Maxine heuristic. We improve upon a forbidden subgraph classification of graphs such that $M$ is equal to the independence number given by Barrus and Molnar in 2015.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
