zbMATH — the first resource for mathematics

Diamond-free degree sequence. (English) Zbl 1301.05338
Summary: While attempting to classify partial linear spaces produced during the execution of an extension of hill-climbing algorithm a new problem arises, that of generating all graphical degree sequences that are diamond-free (i.e. have no diamond as subgraph) and satisfy additional constraints. We formalize this new problem, propose a constraint programming solution and list all satisfying degree sequences of length 8 to 16 inclusive.

05C85 Graph algorithms (graph-theoretic aspects)
05C07 Vertex degrees
05C90 Applications of graph theory
05B05 Combinatorial aspects of block designs
90C35 Programming involving graphs or networks
90C59 Approximation methods and heuristics in mathematical programming