论文信息 - Three nonisomorphic triangulations of an orientable surface with the same complete graph

Three nonisomorphic triangulations of an orientable surface with the same complete graph

Abstract We identify three mutually nonisomorphic triangulations of the closed orientable surface of genus 20, each with the complete graph on 19 vertices.

Seiya Negami | Serge Lawrencenko | Arthur T. White

[1] Arthur T. White,et al. Block designs and graph imbeddings , 1978, J. Comb. Theory, Ser. B.

[2] Elmer S. West. From the U. S. A. , 1965 .

[3] A. White. Graphs, Groups and Surfaces , 1973 .

[4] 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.

[5] Seiya Negami,et al. Uniqueness and faithfulness of embedding of toroidal graphs , 1983, Discret. Math..

[6] G. Ringel,et al. Bestimmung der Maximalzahl der Nachbargebiete auf nichtorientierbaren Flächen , 1954 .

[7] G. Ringel. Bestimmung der Maximalzahl der Nachbargebiete auf nichtorientierbaren Flächen , 1953 .

[8] David W. Barnette,et al. Generating the triangulations of the projective plane , 1982, J. Comb. Theory, Ser. B.