scientific article; zbMATH DE number 4194596

zbMATH Open0724.52008MaRDI QIDQ3211902FDOQ3211902

A. Bezdek, Károly Bezdek

Publication date: 1989

Title of this publication is not available (Why is that?)

zbMATH Keywords

combinatorial propertiesextremum problemsnumber of segmentsEuclidean hyperbolic and elliptic geometriesopen and closed cycles

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Euclidean geometries (general) and generalizations (51M05) Inequalities and extremum problems in real or complex geometry (51M16) Elementary problems in hyperbolic and elliptic geometries (51M09)

Cited In (2)

• Loops of Regular Polygons
• Assembling r-gons Out of n Given Segments

   Recommendations

• Title not available (Why is that?) 👍 👎
• A lower bound for the number of polygonizations of \(N\) points in the plane 👍 👎
• On circumscribing polygons for line segments 👍 👎
• Covering the complete graph with plane cycles 👍 👎
• On a partition into convex polygons 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3211902)