Algorithms for Triangulating Polyhedra Into a Small Number of Tethraedra
Milica Stojanović (2005)
Matematički Vesnik
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “A linear-time construction of Reuleaux polygons.”
Algorithms for Triangulating Polyhedra Into a Small Number of Tethraedra
Minimal size of a graph with diameter 2 and given maximal degree. II.
Znám, Š. (1992)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Blueprint for a classic proof of the 4 colour theorem
Patrick Labarque (2010)
Visual Mathematics
Similarity:
Neighbourhood tournaments
Bohdan Zelinka (1986)
Mathematica Slovaca
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
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:
The isogonal sponges on the cubic lattice.
Gillispie, Steven B., Grünbaum, Branko (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the number of cut-vertices in a graph.
Hopkins, Glenn, Staton, William (1989)
International Journal of Mathematics and Mathematical Sciences
Similarity: