论文信息 - Polyhedral Suspensions of Arbitrary Genus

Polyhedral Suspensions of Arbitrary Genus

A new class of polyhedra is discovered—bipyramids of arbitrarily prescribed genus. A two-dimensional generalization of Fáry’s Theorem is established. A purely combinatorial definition of a polyhedral suspension is given. A new regular two-dimensional polyhedron is constructed in four dimensions.

Serge Lawrencenko | S. Lawrencenko

[1] H. Coxeter,et al. Introduction to Geometry. , 1961 .

[2] Jonathan L. Gross,et al. A combinatorial characterization of planar 2-complexes , 1981 .

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

[4] W. Sierpinski,et al. Sur le probléme des courbes gauches en Topologie , 2022 .

[6] S. Lawrencenko. Irreducible triangulations of a torus , 1987 .

[7] János Pach,et al. Crossing Number of Toroidal Graphs , 2005, Graph Drawing.

[8] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[9] E. Steinitz,et al. Vorlesungen über die Theorie der Polyeder unter Einfluss der Elemente der Topologie , 1934 .

[10] Vladimir P. Korzhik,et al. Realizing the chromatic numbers of triangulations of surfaces , 1993, Discret. Math..

[11] Petr Hlinený,et al. Approximating the Crossing Number of Toroidal Graphs , 2007, ISAAC.

[12] Richard D. Ringeisen. Graphs of given genus and arbitrarily large maximum genus , 1973, Discret. Math..

[13] H. S. M. Coxeter,et al. Vorlesungen über die Theorie der Polyeder , 1935 .

[14] In-kyeong Choi. On straight line representations of random planar graphs , 1992 .

[15] Jonathan L. Gross,et al. A Linear Time Planarity Algorithm for 2-Complexes , 1979, JACM.

[16] Jonathan L. Gross,et al. Topological Graph Theory , 1987, Handbook of Graph Theory.