登入選單
返回Google圖書搜尋
Every Planar Map is Four Colorable
Kenneth I. AppelWolfgang Haken
出版American Mathematical Soc., 1989
主題Mathematics / GeneralMathematics / Discrete MathematicsMathematics / Geometry / GeneralMathematics / Graphic MethodsMathematics / Combinatorics
ISBN08218510399780821851036
URLhttp://books.google.com.hk/books?id=ePYbCAAAQBAJ&hl=&source=gbs_api
EBookSAMPLE
註釋In this volume, the authors present their 1972 proof of the celebrated Four Color Theorem in a detailed but self-contained exposition accessible to a general mathematical audience. An emended version of the authors' proof of the theorem, the book contains the full text of the supplements and checklists, which originally appeared on microfiche. The thiry-page introduction, intended for nonspecialists, provides some historical background of the theorem and details of the authors' proof. In addition, the authors have added an appendix which treats in much greater detail the argument for situations in which reducible configurations are immersed rather than embedded in triangulations. This result leads to a proof that four coloring can be accomplished in polynomial time.