2 citations · 2 across the 2 of their papers we have counts for
3 papers
math.MG2020
An analogue of a theorem of Steinitz for ball polyhedra in
Sami Mezal Almohammad, Márton Naszódi, Zsolt Lángi
Steinitz's theorem states that a graph is the edge-graph of a -dimensional convex polyhedron if and only if, is simple, plane and -connected. We prove an analogue of…
math.MG2019
On some average properties of convex mosaics
G. Domokos, Z. Lángi
In a convex mosaic in we denote the average number of vertices of a cell by and the average number of cells meeting at a node by . Except for the $…
math.MG2017★ 2 cited
A characterization of affinely regular polygons
Zsolt Langi
In 1970, Coxeter gave a short and elegant geometric proof showing that if are vertices of an -gon in cyclic order, then is affinely regular if, a…