Running summarizing tools on a new article
Check the paper below, then start its synthesis.
Every Planar Map is Four Colorable
Kenneth Appel, Wolfgang Haken
Contemporary mathematics - American Mathematical Society
DOI: 10.1090/conm/098 (Computer Science)
License: not stated (all rights reserved)
Abstract: The following theorem is proved.THEOREM .Every planar map can be colored with at most four colors. AMS (MOS) subject classifications (1970). Primary05C15. 1 This work appears in full in two papers, Every planar map is four colorable; part I, Discharging, by K. Appel and W. Haken and part II, Reducibility, by K. Appel, W. Haken,
Published on 01 Jan. 1989