Neighborliness of marginal polytopes.
Neighborly Maps with Few Vertices.
New Applications of Random Sampling in Computational Geometry.
New extensions of Napoleon's theorem to higher dimensions.
Nonexistence of a weakly neighbourly polyhedral map of type .
Nonobtuse Triangulation of Polygons.
Nonoverlap of the Star Unfolding.
Nonrational, nonsimple convex polytopes in symplectic geometry.
Nontiles and nonfacets for the Euclidean space, spherical complexes and convex polytopes.
Normal polytopes, triangulations, and Koszul algebras.
Note on certain partitions of points in
Note on extremal points
Note on Petri and Hamiltonian cycles in cubic polyhedral graphs.
Note on Petrie and Hamiltonian cycles in cubic polyhedral graphs
In this note we show that deciding the existence of a Hamiltonian cycle in a cubic plane graph is equivalent to the problem of the existence of an associated cubic plane multi-3-gonal graph with a Hamiltonian cycle which takes alternately left and right edges at each successive vertex, i.ei̇t is also a Petrie cycle. The Petrie Hamiltonian cycle in an -vertex plane cubic graph can be recognized by an -algorithm.
Note on the weight of paths in plane triangulations of minimum degree 4 and 5
The weight of a path in a graph is defined to be the sum of degrees of its vertices in entire graph. It is proved that each plane triangulation of minimum degree 5 contains a path P₅ on 5 vertices of weight at most 29, the bound being precise, and each plane triangulation of minimum degree 4 contains a path P₄ on 4 vertices of weight at most 31.
Notes on the algebra and geometry of polynomial representations.
Notions of denseness.