Abstract
A proper coloring of a graph G in k colors, or k-coloring, is a function f : VG → {1, 2, ... , k} such that f(u) ≠ f(υ) for any adjacent vertices u, υ of G. The number f(u) is called the color of the vertex u. A graph that has a proper k-coloring is called k-colorable.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Melnikov, O., Sarvanov, V., Tyshkevich, R., Yemelichev, V., Zverovich, I. (1998). Graph Colorings. In: Exercises in Graph Theory. Kluwer Texts in the Mathematical Sciences, vol 19. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-1514-0_10
Download citation
DOI: https://doi.org/10.1007/978-94-017-1514-0_10
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-4979-7
Online ISBN: 978-94-017-1514-0
eBook Packages: Springer Book Archive