Abstract
The problems of this chapter are concerned with the partitioning of a set into a finite number of subsets. The partitioning is done by coloring each element of a subset by the same color. The prototypical example runs as follows.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1998 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
(1998). Coloring Proofs. In: Problem-Solving Strategies. Problem Books in Mathematics. Springer, New York, NY. https://doi.org/10.1007/0-387-22641-9_2
Download citation
DOI: https://doi.org/10.1007/0-387-22641-9_2
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-98219-9
Online ISBN: 978-0-387-22641-5
eBook Packages: Springer Book Archive