Complete Colorings

Gary Chartrand, Teresa W. Haynes, Michael A. Henning, Ping Zhang

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review


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.

Original languageEnglish
Title of host publicationSpringerBriefs in Mathematics
PublisherSpringer Science and Business Media B.V.
Number of pages11
Publication statusPublished - 2019

Publication series

NameSpringerBriefs in Mathematics
ISSN (Print)2191-8198
ISSN (Electronic)2191-8201

ASJC Scopus subject areas

  • General Mathematics


Dive into the research topics of 'Complete Colorings'. Together they form a unique fingerprint.

Cite this