Title

Complete Colorings

Document Type

Book Contribution

Publication Date

1-1-2019

Description

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.

Share

COinS