Z. Ales, A. Knippel, and A. Pauchet, Polyhedral combinatorics of the k-partitioning problem with representative variables, Discrete Applied Mathematics, vol.211, pp.1-14, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01759687

F. Barahona and A. R. Mahjoub, On the cut polytope, Mathematical Programming, vol.36, pp.157-173, 1986.

A. Bertoni, P. Campadelli, and G. Grossi, An approximation algorithm for the maximum cut problem and its experimental analysis, Discrete Applied Mathematics, vol.110, pp.3-12, 2001.

S. Borne, P. Fouilhoux, G. Lacroix, M. Pesneau, and P. , Branch-and-cut algorithm for the connected-cut problem, ROADEF -15ème congrès annuel de la Société française de recherche opérationnelle et d'aideà la décision, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00946285

G. J. Chang, C. Chen, and Y. Chen, Vertex and tree arboricities of graphs, Journal of Combinatorial Optimization, vol.8, pp.295-306, 2004.

. Color02, Computational symposium: Graph coloring and its generalizations, 2002.

R. Cordone and F. Maffioli, On the complexity of graph tree partition problems, Discrete Applied Mathematics, vol.134, pp.51-65, 2004.

F. Della-croce, M. J. Kaminski, and V. T. Paschos, An exact algorithm for max-cut in sparse graphs, Operations Research Letters, vol.35, pp.403-408, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00116633

P. Festa, P. M. Pardalos, M. G. Resende, and C. C. Ribeiro, Randomized heuristics for the max-cut problem, Optimization Methods and Software, vol.17, pp.1033-1058, 2002.

A. Frieze and M. Jerrum, Improved approximation algorithms for max k-cut and max bisection, Integer Programming and Combinatorial Optimization. IPCO 1995, vol.920, pp.1-13, 1995.

M. X. Goemans and D. P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefine programming, Journal of the Association for Computing Machinery, vol.42, pp.1115-1145, 1995.

O. Goldschmidt and D. S. Hochbaum, Polynomial algorithm for the k-cut problem, 29th Ann. Symp. Foundation of Computer Science, pp.444-451, 1988.

F. Hadlock, Finding a maximum cut of a planar graph in polynomial time, SIAM J. Comput, vol.4, pp.221-225, 1975.

D. J. Haglin and S. M. Venkatesan, Approximation and intractability results for the maximum cut problem and its variants, IEEE Transactions on Computers, vol.40, pp.110-113, 1991.

C. Hojny, I. Joormann, H. Lüthen, and M. Schmidt, Mixed-integer programming techniques for the connected max-k-cut problem. Unpublished, 2018.

S. Kahruman, E. Kolotoglu, S. Butenko, and I. V. Hicks, On greedy construction heuristics for the max-cut problem, Int. J. of Computational Science and Engineering, vol.3, pp.211-218, 2007.

R. M. Karp, Reducibility among combinatorial problems, Complexity of Computer Computations. The IBM Research Symposia Series, pp.85-103, 1972.

G. A. Kochenberger, J. Hao, L. H. Zhipeng, and F. Glover, Solving large scale max cut problems via tabu search, J Heuristics, vol.19, pp.565-571, 2013.

S. Lin and B. W. Kernighan, An effective heuristic algorithm for the traveling-salesman problem, Operations Research, vol.21, pp.498-516, 1973.

A. F. Ling, C. X. Xu, and F. M. Xu, A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems, European Journal of Operational Research, vol.197, pp.519-531, 2009.

G. I. Orlova and Y. G. Dorfman, Finding the maximum cut in a graph, Engineering Cybernetics, vol.10, pp.502-506, 1972.

F. Rendl, G. Rinaldi, and A. Wiegele, Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxations, Mathematical Programming, vol.121, pp.307-335, 2008.

S. Sahni and T. Gonzales, P-complete approximation problems, Journal of the ACM, vol.23, pp.555-565, 1976.

W. Zhu and C. Guo, A local search approximation algorithm for max-k-cut of graph and hypergraph, 2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming, pp.236-240, 2011.