Demange, Marc Ekim, Tinaz Ries, Bernard Tanasescu, Cerasela 2015 In this paper we present the Selective Graph Coloring Problem, a generalization of the standard graph col-oring problem as well as several of its possible applications. Given a graph with a partition of its vertex set into several clusters, we want to select one vertex per cluster such that the chromatic number of the subgraph induced by the selected vertices is minimum. This problem appeared in the literature under dif-ferent names for specific models and its complexity has recently been studied for different classes of graphs. Here, we describe different models – some already discussed in previous papers and some new ones – in very different contexts under a unified framework based on this graph problem. We point out similarities between these models, offering a new approach to solve them, and show some generic situations where the selective graph coloring problem may be used. We focus on specific graph classes motivated by each model, and we briefly discuss the complexity of the selective graph coloring problem in each one of these graph classes and point out interesting future research directions. application/pdf https://folia.unifr.ch/global/documents/308608 https://folia.unifr.ch/documents/308608/files/selectivecopy.pdf eng info:eu-repo/semantics/altIdentifier/doi/10.1016/j.ejor.2014.05.011 info:eu-repo/semantics/openAccess License undefined European Journal of Operational Research. - 2015, vol. 240, no. 2, p. 307-314 combinatorial optimization graph theory partition colouring selective colouring computational complexity info:eu-repo/classification/udc/004 On some applications of the selective graph coloring problem http://purl.org/coar/resource_type/c_6501