Given a graph G and a positive integer K, the inverse chromatic number problem consists in modifying the graph as little as possible so that it admits a chromatic number not greater than K. In this paper, we focus on the inverse chromatic number problem for certain classes of graphs. First, we...

Recent literature on supply chain coordination offers a wide range of game theoretic and optimization approaches that ensure efficient planning in the supply chain, but assume that the involved parties have complete information about each other. However, in reality, complete information is...