154
views
1
recommends
+1 Recommend
1 collections
    0
    shares
       
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      A proof of four color conjecture (4CC)

      Preprint
      In review
      research-article
        1 ,
      ScienceOpen Preprints
      ScienceOpen
      n–MSPG, n-1–MSPG, delta–wheel, delta–cycle, KempeChain (KC), 3–vertex colorable, 4–vertex colorable, 4CC
      Bookmark

            Abstract

            foundout a critical corresponding relationship between a δwheelof any maximal simple plane graph of n vertices(nMSPG)and its corresponding δcycleof a corresponding n-1MSPGof the nMSPG, and relied on theinductive way, while with the help of KempeChain (KC), this article gives a brand-newlogical proof for the famous and morethan 100 years old fourcolor conjecture (4CC).

            Content

            Author and article information

            Journal
            ScienceOpen Preprints
            ScienceOpen
            24 February 2021
            Affiliations
            [1 ] department of basic courses, Sichuan College of Traditional Chinese Medicine, Mianyang city, 621000, Sichuan province, China.
            Article
            10.14293/S2199-1006.1.SOR-.PPTJM5E.v1
            2c51a154-729a-40dc-b097-c30d52c5247d

            This work has been published open access under Creative Commons Attribution License CC BY 4.0 , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Conditions, terms of use and publishing policy can be found at www.scienceopen.com .


            All data generated or analysed during this study are included in this published article (and its supplementary information files).
            Mathematics
            n–MSPG,n-1–MSPG,delta–wheel,delta–cycle,KempeChain (KC),3–vertex colorable,4–vertex colorable,4CC

            Comments

            Comment on this article