A coloring over the vertices of a graph is said to be proper, if no pair of adjacent vertices receive the same color. Proper coloring of graphs (graph partitioning methods) is a well-studied topic in graph theory that has many applications in different fields. In this talk we apply graph partitioning techniques to study some problems in additive manufacturing. The aim is to find the smallest number of parts needed to design a product in such a way that there is no pair of conflicting functional requirements.