无Diamond度序列
Diamond-free Degree Sequences
摘要：
我们引入了一个新的问题，CSPLib问题编号50，以生成所有度序列，这些度序列具有相应的具有次要性质的无钻石图。这个问题自然产生于数学中的一个问题，与平衡不完全区组设计有关;我们将在本文中专门讨论这一问题。这个问题本身是具有挑战性的计算工作所产生的大量对称性的模型。我们介绍了两个模型为这个问题。第二个模型是对第一个模型的改进，这种改进主要包括将问题分为两个阶段，第一阶段产生满足算术约束的图形度序列，第二部分测试存在一个无钻石的度序列的图。
英文摘要：
We introduce a new problem, CSPLib problem number 50, to generate all degree sequences that have a corresponding diamond-free graph with secondary properties. This problem arises naturally from a problem in mathematics to do with balanced incomplete block designs; we devote a section of this paper to this. The problem itself is challenging with respect to computational effort arising from the large number of symmetries within the models. We introduce two models for this problem. The second model is an improvement on the first, and this improvement largely consists of breaking the problem into two stages, the first stage producing graphical degree sequences that satisfy arithmetic constraints and the second part testing that there exists a graph with that degree sequence that is diamond-free.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
