An algorithm for lower than 32 points maximum plane graph's all 4-colorings
Bin Cheng, Jian Cheng · 2017 IEEE 2nd Information Technology, Networking, Electronic and Automation Control Conference (ITNEC) · 2017
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. At present using this algorithm can calculate 32 order maximal planar graph's all 4-coloring.