Without a doubt, organizational commitment has become a variable of central interest over the past two decades, due in large part to the demonstrated link between commitment and turnover (Allen & Meyer, 1996; Mathieu & Zajac, 1990; Tett & Meyer, 1993). Over the years, research has demonstrated that commitment is a multidimensional construct (e.g., Allen & Meyer, 1990; Mayer & Schoorman, 1992; O...

In this work we study the polytope associated with a 0/1 integer programming formulation for the Equitable Coloring Problem. We find several families of valid inequalities and derive sufficient conditions in order to be facet-defining inequalities. We also present computational evidence of the effectiveness of including these inequalities as cuts in a Branch & Cut algorithm.

In this paper, by the sorting method of vertices, it is obtained that the equitable chromatic number and the equitable chromatic threshold of the Cartesian products of fans with bipartite graphs.

An equitable colouring of a balanced G-design (X,B) is a map φ∶B → C such that ∣bi(x) − bj(x)∣ ≤ 1 for any x ∈ X and i, j, with i ≠ j, being bi(x) the number of blocks containing the vertex x and coloured with the colour i. A c-colouring is a colouring in which exactly c colours are used. A c-colouring of type s is a colourings in which, for every vertex x, all the blocks containing x are colou...

An equitable graph coloring is a proper vertex coloring, such that the size of the color classes differ by at most one. We present a flow-based scheme for generating pruning rules for enumerative algorithms such as DSATUR. The scheme models the extendability of a partial (equitable) coloring into an equitable coloring via network flows. Computational experiments show that significant reductions...