Adam N. Letchford, Michael M. Sørensen, “Binary positive semidefinite matrices and associated integer polytopes”, Math. Program., 131, no. 1-2, 2012, 253
M. Labbé, F. Aykut Özsoy, “Size-constrained graph partitioning polytopes”, Discrete Mathematics, 310, no. 24, 2010, 3473
Vilmar Jefté Rodrigues de Sousa, Miguel F. Anjos, Sébastien Le Digabel, “Computational study of valid inequalities for the maximum k-cut problem”, Ann Oper Res, 265, no. 1, 2018, 5
Walid Ben‐Ameur, Ali Ridha Mahjoub, José Neto, Paradigms of Combinatorial Optimization, 2014, 131
Adam N. Letchford, Michael M. Sørensen, 5035, Integer Programming and Combinatorial Optimization, 2008, 125
Caterina De Simone, Michel Deza, Monique Laurent, “Collapsing and lifting for the cut cone”, Discrete Mathematics, 127, no. 1-3, 1994, 105
Hamidreza Validi, Austin Buchanan, “Political districting to minimize cut edges”, Math. Prog. Comp., 14, no. 4, 2022, 623
Andreas Eisenblätter, 2337, Integer Programming and Combinatorial Optimization, 2002, 273
Michel Deza, Monique Laurent, “Applications of cut polyhedra — I”, Journal of Computational and Applied Mathematics, 55, no. 2, 1994, 191
E.R. van Dam, R. Sotirov, “New bounds for the max-k-cut and chromatic number of a graph”, Linear Algebra and its Applications, 488, 2016, 216