It is known that a planar graph containing a proper subgraph with only three points in the boundary between the subgraph and its complement is four-color reducible; that is, if the subgraph and the complement plus the boundary are each colorable with four colors, then the original graph is four-colorable. A proof of reducibility has been lacking for the case of subgraphs whose boundaries contain four points. This paper demonstrates, under an inductive hypothesis that graphs smaller than the original graph can be four-colored, that each of the components will have several possible colorings, and there will always be a pair of colorings for the components that will match. 4 pp.
This report is part of the RAND Corporation Paper series. The paper was a product of the RAND Corporation from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.
This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.
The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.