Abstract
In this chapter we discuss partitions of the vertex-set, or edge-set, of a graph into subsets such that no two elements of the same subset are adjacent. Such partitions are called colorings for historical reasons (which will become clearer in Section 8.3).
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
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Wallis, W.D. (2000). Graph Colorings. In: A Beginner’s Guide to Graph Theory. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4757-3134-7_7
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3134-7_7
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4757-3136-1
Online ISBN: 978-1-4757-3134-7
eBook Packages: Springer Book Archive