In a proper k-coloring of a k-chromatic graph, for every two distinct colors there are always adjacent vertices with these colors. This observation has led to a coloring called a complete coloring, which is the primary topic of this chapter.
Chartrand, Gary; Haynes, Teresa W.; Henning, Michael A.; and Zhang, Ping, "Complete Colorings" (2019). ETSU Faculty Works. 501.