Is the problem of determining whether a given graph can be colored with 3 colors in such a way that no two adjacent vertices have the same color, known as the 3-coloring problem, considered to be NP-complete?