Abstract
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.
Cite
CITATION STYLE
APA
Chartrand, G., Haynes, T. W., Henning, M. A., & Zhang, P. (2019). Complete Colorings. In SpringerBriefs in Mathematics (pp. 69–79). Springer Science and Business Media B.V. https://doi.org/10.1007/978-3-030-31110-0_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free