Abstract
A proper coloring or coloring of a graph assigns colors usually denoted by 1, 2, 3, … etc., to the vertices of G, one color per vertex, so that the adjacent vertices are assigned different colors.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2013 Springer India
About this chapter
Cite this chapter
Saha Ray, S. (2013). Coloring. In: Graph Theory with Algorithms and its Applications. Springer, India. https://doi.org/10.1007/978-81-322-0750-4_8
Download citation
DOI: https://doi.org/10.1007/978-81-322-0750-4_8
Published:
Publisher Name: Springer, India
Print ISBN: 978-81-322-0749-8
Online ISBN: 978-81-322-0750-4
eBook Packages: EngineeringEngineering (R0)