论文信息 - A three color problem - 字舞流文

A three color problem

Yi-Ching Yao | Yi-Ching Yao | G. Simons | Gordon D. Simons

[1] Branko Grünbaum. Grötzsch's theorem on $3$-colorings. , 1963 .

[2] O. Ore. The Four-Color Problem , 1967 .

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

[4] R. L. Brooks. On Colouring the Nodes of a Network , 1941 .

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

[6] Larry Stockmeyer,et al. Planar 3-colorability is polynomial complete , 1973, SIGA.

[7] Paul C. Kainen,et al. The Four-Color Problem , 1977 .