The report for C₆₀’s four dual Maximum Planar Graph’s all 4-colorings

Those Maximum Planar Graph whose vertex sequence 5<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">12</sup>6<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">20</sup> has found four. They are Buckminsterfullerene -C₆₀’s dual Graph. Thus, C₆₀ exists in four primary forms at least. This paper bases on professor Shouchun Xu’s two algorithms, which are looking for batch of 4-coloring solution and using Kempe two color transform to generate 4-coloring trees, The integrated using of these two algorithms and got an algorithm to find low-order maximal planar graph’s all 4-colorings. This paper shows relevant findings for these four Maximum Planar Graph’s all 4-colorings .