The Rhombidodecahedral Tessellation of 3-Space and a Particular 15-Vertex Triangulation of the 3-Dimensional Torus.

Wolfgang Kühnel; Gunter Lassmann

Displaying similar documents to “The Rhombidodecahedral Tessellation of 3-Space and a Particular 15-Vertex Triangulation of the 3-Dimensional Torus.”

Algorithms for Triangulating Polyhedra Into a Small Number of Tethraedra

Milica Stojanović (2005)

Matematički Vesnik

Similarity:

A simpler construction of volume polynomials for a polyhedron.

Lawrencenko, Serge, Negami, Seiya, Sabitov, Idjad Kh. (2002)

Beiträge zur Algebra und Geometrie

Similarity:

Neighbourhood tournaments

Bohdan Zelinka (1986)

Mathematica Slovaca

Similarity:

Three-dimensional pseudomanifolds on eight vertices.

Datta, Basudeb, Nilakantan, Nandini (2008)

International Journal of Mathematics and Mathematical Sciences

Similarity:

A census of vertices by generations in regular tessellations of the plane.

Paul, Alice, Pippenger, Nicholas (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Minimal size of a graph with diameter 2 and given maximal degree. II.

Znám, Š. (1992)

Acta Mathematica Universitatis Comenianae. New Series

Similarity:

A linear-time construction of Reuleaux polygons.

Kupitz, Yaakov, Martini, Horst, Wegner, Bernd (1996)

Beiträge zur Algebra und Geometrie

Similarity:

5-Stars of Low Weight in Normal Plane Maps with Minimum Degree 5

Oleg V. Borodin, Anna O. Ivanova, Tommy R. Jensen (2014)

Discussiones Mathematicae Graph Theory

Similarity:

It is known that there are normal plane maps M5 with minimum degree 5 such that the minimum degree-sum w(S5) of 5-stars at 5-vertices is arbitrarily large. In 1940, Lebesgue showed that if an M5 has no 4-stars of cyclic type (5, 6, 6, 5) centered at 5-vertices, then w(S5) ≤ 68. We improve this bound of 68 to 55 and give a construction of a (5, 6, 6, 5)-free M5 with w(S5) = 48