Realizing the chromatic numbers of triangulations of surfaces
暂无分享,去创建一个
[1] G. Ringel. Bestimmung der Maximalzahl der Nachbargebiete auf nichtorientierbaren Flächen , 1953 .
[2] G. Ringel,et al. Solution of the heawood map-coloring problem. , 1968, Proceedings of the National Academy of Sciences of the United States of America.
[3] Frank Harary,et al. Graph Theory , 2016 .
[4] A. White. Graphs, Groups and Surfaces , 1973 .
[5] K. Appel,et al. Every planar map is four colorable. Part II: Reducibility , 1977 .
[6] K. Appel,et al. Every planar map is four colorable. Part I: Discharging , 1977 .
[7] K. Appel,et al. Every Planar Map Is Four Colorable , 2019, Mathematical Solitaires & Games.