Algorithms for Triangulating Polyhedra Into a Small Number of Tethraedra
Milica Stojanović (2005)
Matematički Vesnik
Similarity:
Milica Stojanović (2005)
Matematički Vesnik
Similarity:
Kupitz, Yaakov, Martini, Horst, Wegner, Bernd (1996)
Beiträge zur Algebra und Geometrie
Similarity:
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
Znám, Š. (1992)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Nilakantan, Nandini (2003)
Experimental Mathematics
Similarity:
Bohdan Zelinka (1986)
Mathematica Slovaca
Similarity:
Štefan Znám (1980)
Mathematica Slovaca
Similarity:
Hopkins, Glenn, Staton, William (1989)
International Journal of Mathematics and Mathematical Sciences
Similarity: