@inbook{a6551ed205734e78ba373ffe9748a4bf,
title = "Complete Colorings",
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.",
author = "Gary Chartrand and Haynes, {Teresa W.} and Henning, {Michael A.} and Ping Zhang",
note = "Publisher Copyright: {\textcopyright} 2019, The Author(s), under exclusive license to Springer Nature Switzerland AG.",
year = "2019",
doi = "10.1007/978-3-030-31110-0_7",
language = "English",
series = "SpringerBriefs in Mathematics",
publisher = "Springer Science and Business Media B.V.",
pages = "69--79",
booktitle = "SpringerBriefs in Mathematics",
address = "Germany",
}