[
[1] R. J. Aumann, Acceptable points in general cooperative n-person games, in: Tucker, A. W. and Luce, R. D. (Eds.), Contributions to the Theory of Games (AM-40), Volume IV, Princeton: Princeton University Press, 2016, pp. 287–324.
]Search in Google Scholar
[
[2] R. J. Aumann, Acceptable points in games of perfect information, Pacific J. Math., 10 (1960) 381–417.
]Search in Google Scholar
[
[3] E. Boros, P. L. Hammer and G. Tavares, Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO), J. Heuristics, 13 (2007) 99–132.
]Search in Google Scholar
[
[4] R. Carosi, S. Fioravanti, L. Gualá and G. Monaco, Coalition resilient outcomes in MAX-k-cut games, SOFSEM 2019: Theory and Practice of Computer Science. Lecture Notes Comput. Sci., 11376 (2019) 94–107.10.1007/978-3-030-10801-4_9
]Search in Google Scholar
[
[5] R. Carosi and G. Monaco, Generalized graph k-coloring games, COCOON 2018: Computing and Combinatorics. Lecture Notes Comput. Sci., 10976 (2018) 268–279.
]Search in Google Scholar
[
[6] L. Cowen, R. Cowen and D. R. Woodall, Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency, J. Graph Theory, 10 (1986) 187–195.10.1002/jgt.3190100207
]Search in Google Scholar
[
[7] L. Cowen, W. Goddard and C. E. Jesurum, Defective coloring revisited, J. Graph Theory, 4 (1997) 205–219.10.1002/(SICI)1097-0118(199703)24:3<205::AID-JGT2>3.0.CO;2-T
]Search in Google Scholar
[
[8] E. de Klerk, D. V. Pasechnik and J. P. Warners, On approximate graph colouring and MAX-k-cut algorithms based on the ϑ-function, J. Comb. Optim., 8 (2004) 267–294.10.1023/B:JOCO.0000038911.67280.3f
]Search in Google Scholar
[
[9] V. J. R. de Sousa, Global optimization of the max k-cutproblem, Ph.D. Dissertation, Département de Mathématiques et de Génie Industriel,École Polytechnique de Montréal, 2018.
]Search in Google Scholar
[
[10] B. Escoffier, L. Gourvès and J. Monnot, Strategic coloring of a graph, CIAC 2010: Algorithms and Complexity. Lecture Notes Comput. Sci., 6078 (2010) 155–166.10.1007/978-3-642-13073-1_15
]Search in Google Scholar
[
[11] A. Frieze and M. Jerrum, Improved approximation algorithms for MAX-k-cut and MAX BISECTION, Algorithmica, 18 (1997) 67–81.
]Search in Google Scholar
[
[12] A. Garuglieri (candidate), C. Mocenni (relator), D. Madeo (correlator), G. Palma (correlator) and S. Rinaldi (correlator), Giochi di anti-coordinazione: stabilità delle colorazioni ottimali, Master Thesis in Applied Mathematics, 2020.
]Search in Google Scholar
[
[13] L. Gourvès and J. Monnot, On strong equilibria in the Max Cut Game, WINE 2009: Internet and Network Economics. Lecture Notes in Comput. Sci., 5929 (2009) 608–615.10.1007/978-3-642-10841-9_62
]Search in Google Scholar
[
[14] L. Gourvès and J. Monnot, The Max k-cut Game and its strong equilibria, TAMC 2010: Theory and Applications of Models of Computation. Lecture Notes in Comput. Sci., 6108 (2010) 234–246.10.1007/978-3-642-13562-0_22
]Search in Google Scholar
[
[15] R. M. Karp, Reducibility among combinatorial problems, in: Miller, R. E., Thatcher, J. W. and Bohlinger, J. D. (Eds), Complexity of Computer Computations. The IBM Research Symposia Series. Springer, Boston, MA, 1972, pp. 85–103.10.1007/978-1-4684-2001-2_9
]Search in Google Scholar
[
[16] L. Palagi, V. Piccialli, F. Rendl, G. Rinaldi and A. Wiegele, Computational approaches to Max-Cut, Handbook on Semidefinite, Conic and Polynomial Optimization. International Series in Operations Research and Management Science, 166 (2012) 821–847.
]Search in Google Scholar
[
[17] P. N. Panagopoulou and P. G. Spirakis, A game theoretic approach for efficient graph coloring, ISAAC 2008: Algorithms and Computation. Lecture Notes Comput. Sci., 5369 (2008) 183–195.10.1007/978-3-540-92182-0_19
]Search in Google Scholar
[
[18] Q. Wu and J. K. Hao, A memetic approach for the Max-Cut problem, PPSN 2012: Parallel Problem Solving from Nature - PPSN XII. Lecture Notes in Comput. Sci., 7492 (2012) 297–306.10.1007/978-3-642-32964-7_30
]Search in Google Scholar
