Efficiently four-coloring planar graphs

An outline of aquadratic algorithm to 4-color planar graphs is presented, based upon anew proof of the Four Color Theorem. This algorithm improves aquartic algorithm of Appel and Haken.

[1]  George D. Birkhoff,et al.  The Reducibility of Maps , 1913 .

[2]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[3]  Heinrich Heesch,et al.  Untersuchungen zum Vierfarbenproblem , 1969 .

[4]  Norishige Chiba,et al.  A Linear 5-Coloring Algorithm of Planar Graphs , 1981, J. Algorithms.

[5]  K. Appel,et al.  Every Planar Map Is Four Colorable , 2019, Mathematical Solitaires & Games.

[6]  P. J. Heawood.  Map-Colour Theorem , 1949 .

[7]  P. Wernicke,et al.  Über den kartographischen Vierfarbensatz , 1904 .

[8]  Carsten Thomassen,et al.  Every Planar Graph Is 5-Choosable , 1994, J. Comb. Theory B.

[9]  Robin Thomas,et al.  The Four-Colour Theorem , 1997, J. Comb. Theory, Ser. B.

[10]  Arthur Bernhart.  Six-Rings in Minimal Five-Color Maps , 1947 .