论文信息 - On the genus of the graph Kn × K2 or the n-prism - 字舞流文

On the genus of the graph Kn × K2 or the n-prism

Abstract For all n ≠ 5 or 9 (mod 12) the genus of the graph Kn × K2 is shown to be equal to the lower bound given by the Euler formula.

[1] G. Ringel,et al. Über das Problem der Nachbargebiete auf orientierbaren Flächen , 1961 .

[2] G. Ringel. Map Color Theorem , 1974 .

[3] F. Harary,et al. Additivity of the genus of a graph , 1962 .

[4] The genus of Kn − K2 , 1975 .