Quotients of complete graphs: revisiting the Heawood map-coloring problem.
暂无分享,去创建一个
[1] Jonathan L. Gross,et al. Components of branched coverings of current graphs , 1976 .
[2] J. Gross,et al. The topological theory of current graphs , 1974 .
[3] G. Ringel. Map Color Theorem , 1974 .
[4] Jonathan L. Gross,et al. Branched coverings of graph imbeddings , 1973 .
[5] L. R. Welch,et al. Solution of the heawood map-coloring problem—Case 4 , 1970 .
[6] J.W.T. Youngs. Solution of the heawood map-coloring problem—Cases 3, 5, 6, and 9 , 1970 .
[7] J. W. T. Youngs. The heawood map-coloring problem—Cases 1, 7, and 10 , 1970 .
[8] Gerhard Ringel,et al. Solution of the Heawood map-coloring problem—case 11 , 1969 .
[9] Jean Mayer,et al. Le problème des régions voisines sur les surfaces closes orientables , 1969 .
[10] Frank Harary,et al. Graph Theory , 2016 .
[11] 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.
[12] Lloyd R. Welch,et al. The genus of K12s , 1967 .
[13] William Gustin,et al. Orientable embedding of Cayley graphs , 1963 .
[14] G. Ringel. Bestimmung der Maximalzahl der Nachbargebiete auf nichtorientierbaren Flächen , 1953 .
[15] L. Heffter. Ueber das Problem der Nachbargebiete , 1891 .
[16] A. Kempe. On the Geographical Problem of the Four Colours , 1879 .