Two Celebrated Problems
摘要
Histories of two beautiful coloring problems, The Four-Color Problem (4CP) and The Chromatic Number of the Plane Problem (CNP) have been strikingly similar in many ways.