Application of Planar Graph Four-Colorable Algorithm Based on Path Homotopy Search in Heawood Counterexample

In this paper, Heawood's counterexample graph is artificially colored by using the algorithm of planar graph four-colorable based on path homotopy search, which verifies the feasibility and efficiency of the planar graph four-colorable algorithm, thus overturning the judgment of Heawood's counterexample graph that planar graphs can not be four-colored from the dimension of human logical thinking, and consolidate the proof of planar graph four-colorable.